wisdom social multimedia flickr predict forecast unifi framework link recommend random walk abstract phenomen success social network site facebook twitter linkedin revolution peopl commun paradigm attract attent research studi social technolog problem aris problem link recommend critic task help improv user experi essenti network growth effect link recommend algorithm essenti identifi factor influenc link creation paper enumer studi factor propos approach satisfi factor approach estim link relev estim link relev random walk algorithm augment social graph attribut structur inform global local influenc attribut leverag framework link recommend framework rank attribut social network experi dblp imdb data set demonstr method outperform state art method link recommend keyword search text cube find top dk aggreg cell document mine topic dlevel influenc heterogen network shrink structur cluster algorithm detect hierarch commun network visual cube dline analyt process imag mine divers network increment cluster trajectori mine move object trajectori traffic data aggreg multipl judgment evalu order list abstract task search summar result order list item order evalu order list item compar ideal order list creat human expert set item reduc bia multipl human expert creat multipl ideal order list interest challeng evalu method aggreg ideal list comput singl score order list evalu paper propos method aggreg multipl order judgment evalu order list weight correl aggreg rank base aggreg frequent sequenti pattern base aggreg experi result order sentenc text summar show method outperform state art averag correl method term discrimin robust nois propos method frequent sequenti pattern base method perform due flexibl model agreement disagr human expert level granular kei word evalu sentenceord judgment aggreg frequent sequenti pattern mine structur inform mine structur inform network graph regular transduct classif heterogen inform network ndpmine effici mine discrimin numer featur pattern dbase classif fast comput simrank static dynam inform network region dbase onlin promot analysi worldwid tourism recommend system base geotaggedweb photo top dk aggreg queri larg network topcel keyword dbase search top dk aggreg document text cube progress cluster network structur dconnect order travers diagnost powertrac sensor node failur analysi mine period behavior move object mine advisor dadvise relationship research public network commun outlier effici detect inform network hierarch web dpage cluster dpage cross dpage link structur classif class detect data stream activ mine movemin mine move object databas mine knowledg databas inform network analysi approach privaci dawar regress model participatori sens data rankcompet simultan rank cluster web photo keyword extract social snippet entiti relat discoveri web tabl link world wide web consist huge number unstructur text vast amount valuabl structur data web tabl typic type structur inform pervas web web scale method automat extract web tabl studi extens power system octopu mesa extract web tabl fundament compon databas vernacular tabl defin set tupl attribut similarli web tabl defin set row databas tupl column header databas attribut extract web tabl extract relat web databas tabl foreign kei refer tabl hyperlink insid web tabl function foreign kei relat tupl contain hyperlink target page paper explor idea discov attribut web tabl explor hyperlink insid web tabl poster propos solut take web tabl input frequent pattern gener candid relat hyperlink web tabl confid candid evalu trustworthi candid select attribut tabl final show us method perform experi varieti web domain linkrec unifi framework link recommend user attribut graph structur phenomen success network site facebook twitter linkedin social network drawn substanti attent onlin social network site link recommend critic task help improv user experi plai essenti role network growth paper propos link recommend criteria base user attribut graph structur discov candid satisfi criteria link relev estim random walk algorithm augment social graph attribut structur inform global local influenc attribut leverag framework link recommend framework rank attribut social network experi dblp imdb data set demonstr method outperform state art method base network structur node attribut inform link recommend social group suggest user imag collect irin imag retriev imag drich inform network topic initi detect world wide web cetr content extract tag ratio present content extract tag ratio cetr method extract content text divers webpag html document tag ratio describ comput tag ratio line line basi cluster result histogram content content area initi find tag ratio histogram easili cluster dimension extend origin approach order model data dimens present tailor cluster techniqu oper dimension model evalu approach larg set altern method standard accuraci precis recal metric larg vari web corpu final show case cetr achiev content extract perform exist method vari web domain languag style mine concept ddrift data stream recent mine data stream concept drift action insight import challeng task wide rang applic includ credit card fraud protect target market network intrus detect convent knowledg discoveri tool face challeng overwhelm volum stream data concept drift paper propos gener framework mine concept drift data stream weight ensembl classifi train ensembl classif model ripper naiv bayesian sequenti chunk data stream classifi ensembl judici weight base expect classif accuraci test data time evolv environ ensembl approach improv effici learn model accuraci perform classif empir studi show propos method substanti advantag singl classifi approach predict accuraci ensembl framework effect varieti classif model dexamin interesting measur pattern mine unifi framework model massiv rfid data set gatewai dbase movement graph approach invers classif problem invers problem classif system set prototyp case repres set categori similar function case classifi categori find cost minim attribut valu case reclassifi member prefer categori problem invers usual map case unknown categori increas applic classif system busi suggest invers problem signific benefit decis maker form sensit analysi analyt approach invers problem difficult formul constraint difficult determin investig invers problem develop genet algorithm studi perform problem difficulti increas develop real genet algorithm feasibl control tradit binari genet algorithm steepest ascent hill climb algorithm seri simul experi compar perform algorithm optim solut problem difficulti increas attribut class addit analyz algorithm effect level feasibl control oper design fit function determin approach result viabil real genet algorithm import feasibl control problem difficulti increas graph queri optim larg network dramat prolifer sophist network result grow support effect queri mine method larg scale graph structur data core advanc network oper li common critic graph queri primit search graph structur effici larg network graph queri hard due np complet natur subgraph isomorph challeng network examin larg divers paper present high perform graph index mechan spath address graph queri problem larg network spath leverag decompos shortest path vertex neighborhood basic index unit prove effect graph search space prune highli scalabl index construct deploy spath graph queri process optim tradit vertex time fashion effici path time queri decompos set shortest path subset candid good select pick queri plan optim candid path join recov queri graph final graph queri process evalu spath state art graphql real synthet data set experiment studi demonstr effect scalabl spath prove practic effici index method address graph queri larg network swarm mine relax tempor move object cluster recent improv posit technolog make massiv move object data wide import analysi find move object travel exist method put strong constraint defin move object cluster requir move object stick consecut timestamp kei observ move object cluster diverg temporarili congreg timestamp motivatedbythi wepropos theconceptofswarm capturesthemovingobjectsthatmovewithinarbitraryshap cluster timestamp possibl nonconsecut goal paper find discrimin swarm close swarm search space close swarm prohibit huge design method objectgrowth effici retriev answer objectgrowth effect prune strategi propos greatli reduc search space closur check rule develop report close swarm thefli empir studi real data larg synthet data demonstr effect effici method survei social tag techniqu discrimin frequent subgraph mine optim guarante videomul consensu learn approach multi dlabel classif noisi user dgener video mine heterogen inform network explor power link drank comprehens structur similar measur inform network mine heterogen inform network explor power link chronicl dstage densiti dbase cluster algorithm dynam network subspac discoveri promot cell cluster approach integr class detect classif concept ddrift data stream scalabl olap mine inform network rankclu integr cluster rank heterogen inform network analysi real dtime knowledg discoveri dissemin intellig analysi paper describ issu challeng real time knowledg discoveri discuss approach challeng real time data mine stream mine goal extract accur inform support emerg respond war fighter intellig analyst time manner model probabilist measur correl problem determin larg dscale distribut system effici mine close repetit gap subsequ sequenc databas itopicmodel inform network dintegr topic model filter refin dstage approach effici effect anomali detect parallel pathfind algorithm mine structur graph mine person imag collect social group suggest local preserv nonneg matrix factor matrix factor techniqu frequent appli inform process task neg matrix factor nmf receiv consider attent due psycholog physiolog interpret natur occur data represent part base human brain hand geometr perspect data sampl low dimension manifold embed high dimension ambient space hope find compact represent uncov hidden topic simultan respect intrins geometr structur paper propos algorithm call local preserv neg matrix factor lpnmf purpos data point kl diverg evalu similar hidden topic optim map obtain featur valu hidden topic restrict neg vari smoothli geodes data manifold empir studi show encourag result propos algorithm comparison state ofth art algorithm larg high dimension databas assur inform share life cycl heterogen sourc consensu learn decis propag negoti nowadai enorm amount data continu gener massiv scale conflict view import consolid concept intellig decis make predict research area peopl result achiev combin consolid predict obtain public network authorship network textual content public multipl supervis unsupervis hypothes drawn inform sourc negoti differ consolid decis yield accur model due divers heterogen model paper address problem consensu learn compet hypothes reli knowledg supervis learn intern structur unsupervis cluster argu consensu learn np hard problem propos solv effici heurist method construct belief graph propag predict supervis model unsupervis negoti reach consensu final decis consolid calcul model weight base degre consist model experi conduct newsgroup data cora research paper dblp author confer network yahoo movi dataset result show propos method improv classif accuraci cluster qualiti measur nmi base model run time proport number instanc effici larg scale data set classif softwar behavior failur detect discrimin pattern mine approach rank dbase cluster heterogen inform network star network schema explor social tag graph web object classif multi dpartit multi dchunk ensembl techniqu classifi concept ddrift data stream topic cube topic model olap multidimension text databas gad gener activ detect fast cluster larg data mlr dindex index structur fast scalabl similar search high dimens frequent itemset associ rule pattern dgrowth method mine frequent pattern larg databas plai essenti role data mine task broad applic previous propos method adopt apriorilik candid gener test approach method encount challeng mine dataset prolif pattern long pattern stream mine data mine explor optim semant relationship graph multi drelat bayesian classif top ddown mine frequent close pattern high dimension data graph olap multi ddimension framework graph data analysi promot analysi multi ddimension space promot kei ingredi market desir find merit object product person organ servic promot commun paper propos function call promot analysi rank promot object leverag highli rank result object highli rank global space goal discov promot subspac object promin achiev goal notion promot formul show function practic wide varieti applic busi intellig comput promot subspac challeng due explos search space high aggreg cost effici comput propos promorank framework develop effici optim techniqu subspac prune object prune promot cube seamlessli integr framework empir evalu real data set confirm effect promot analysi propos algorithm significantli outperform baselin solut particl dand ddensiti base evolutionari cluster method dynam network recent dynam network attract increas interest due high potenti captur natur social phenomena time discoveri evolutionari commun dynam network critic task previou evolutionari cluster method adopt tempor smooth framework desir featur control balanc tempor nois true concept drift commun major drawback assum fix number commun time allow arbitrari start stop commun time form commun dissolv exist commun common phenomena real dynam network paper propos particl densiti base evolutionari cluster method effici discov variabl number commun arbitrari form dissolv model dynam network collect lot particl call nano commun commun dens connect subset particl call quasi cliqu cliqu shortli kk particl small amount inform evolut data pattern quasi kk inher dynam network provid guidanc find variabl number commun arbitrari form dissolv propos densiti base cluster method effici find tempor smooth local cluster high qualiti cost embed techniqu optim modular propos map method base inform theori make sequenc smooth local cluster close data inher quasi kk result map method easili identifi stage commun stage evolv form dissolv experiment studi data set demonstr method improv cluster accuraci time time perform order magnitud compar current state art method mine graph pattern effici random summari inextcub inform network denhanc text cube nowadai busi administr scientif databas structur attribut text attribut call databas consist multidimension structur data narr text data multidimension text databas search olap mine databas pose research challeng enhanc power data analysi interest entiti relationship extract databas deriv heterogen inform network turn substanti increas power flexibl data explor databas base previou studi textcub topiccub inform network analysi rankclu netclu construct inextcub inform network enhanc text cube demo show power inextcub search analysi multidimension text databas dblp base cs bibliograph databas ii onlin new databas topic model olap multidimension text databas topic cube applic spars project graph recent studi shown canon algorithm princip compon analysi pca linear discrimin analysi lda obtain graph base dimension reduct framework algorithm yield project map linear combin origin featur result difficult interpret psycholog physiolog paper present techniqu learn spars project graph data reduc subspac repres linear combin subset relev featur compar pca lda result obtain spars project easier interpret algorithm base graph embed model encod discrimin geometr structur term data affin embed result obtain appli regular regress learn set spars basi function specif norm regular lasso spars project effici comput experiment result document databas demonstr effect method effect present graph pattern structur repres approach research interest gener interest data mine data wareh databas system current research focus model manag analyz larg scale graph inform network data model hidden topic document manifold data mine imag fvideo process promis research frontier dcube answer prefer queri multi ddimension space applic involv decis make onlin olap style prefer analysi multidimension boolean select typic prefer queri includ top queri skylin queri analyt queri set boolean predic constrain target subset data vari increment drill roll oper effici support prefer queri multipl boolean predic boolean thenprefer prefer boolean approach satisfactori integr boolean prune prefer prune unifi framework propos signatur materi measur multi dimension group by base propos cube data cube prefer queri studi complet life cycl includ signatur gener compress decomposit increment mainten usag effici line analyt queri process present signatur base progress algorithm simultan push boolean prefer constraint deep databas search perform studi show propos method achiev order magnitud speed exist approach trajectori outlier detect partit dand ddetect framework abstract outlier detect popular data mine task lack studi outlier detect trajectori data wors exist trajectori outlier detect algorithm limit capabl detect outli subtrajectori paper propos partit detect framework trajectori outlier detect partit trajectori set line segment detect outli line segment trajectori outlier primari advantag framework detect outli trajectori trajectori databas base partit detect framework develop trajectori outlier detect algorithm traod algorithm consist phase partit detect phase propos level trajectori partit strategi ensur high qualiti high effici phase present hybrid distanc base densiti base approach experiment result demonstr traod correctli detect outli trajectori real trajectori data direct discrimin pattern mine effect classif classif train linear discrimin analysi linear time abstract linear discrimin analysi lda popular method extract featur preserv class separ wide field inform process machin learn data mine inform retriev pattern recognit comput lda involv dens matric eigen decomposit computation expens time memori specif lda mnt time complex requir mn mt nt memori number sampl number featur min larg infeas appli lda paper propos algorithm discrimin analysi call spectral regress discrimin analysi srda spectral graph analysi srda cast discrimin analysi regress framework facilit effici comput regular techniqu theoret analysi show srda comput ms time ms memori averag number featur sampl extens experiment result real world data set demonstr effect effici algorithm graph olap onlin analyt process graph research interest gener interest data mine data wareh databas system current research focus model manag analyz larg scale graph inform network data dneg matrix factor manifold recent neg matrix factor nmf receiv lot attent inform retriev comput vision pattern recognit nmf aim find neg matric product approxim origin matrix size matric smaller origin matrix result compress version origin data matrix solut nmf yield natur part base represent data nmf appli data represent major disadvantag fail geometr structur data paper develop graph base approach part base data represent order overcom limit construct affin graph encod geometr inform seek matrix factor respect graph structur demonstr success algorithm appli real world problem text cube comput ir measur multidimension text databas analysi practic approach classifi evolv data stream train limit amount label data stream sequenti pattern mine precis error bound explor power heurist link multi drelat data mine direct mine discrimin essenti frequent pattern model dbase search tree knowledg transfer multipl model local structur map effect knowledg transfer classif algorithm depend differ distribut gener train exampl test exampl drawn task difficult train exampl domain test domain paper propos local weight ensembl framework combin multipl model transfer learn weight dynam assign model predict power test integr advantag learn algorithm label inform multipl train domain unifi classif model appli domain importantli previous propos method base learn method requir specif design transfer learn show optim local weight ensembl framework gener approach combin multipl model domain transfer propos implement local weight assign map structur model structur test domain weight model local consist neighborhood structur test experiment result text classif spam filter intrus detect data set demonstr signific improv classif accuraci gain framework transfer learn task newsgroup messag categor propos local weight ensembl framework achiev accuraci singl model predict correctli test exampl summari improv accuraci problem mine prefer superior inferior exampl mine user prefer plai critic role import applic custom relationship manag crm product servic recommend market campaign paper identifi interest practic problem mine user prefer multidimension space user prefer categor attribut unknown superior inferior exampl provid user learn user prefer categor attribut model problem systemat show mine user prefer superior inferior exampl challeng problem great potenti practic knowledg explor systemat attempt tackl problem propos greedi method show method practic real data set synthet data set data mine diagnost debug sensor network preliminari evid lesson learn sparclu spatial relationship pattern dbase hierarchi cluster cispan comprehens increment mine algorithm close sequenti pattern multi dversion softwar mine recent frequent sequenti pattern mine algorithm wide softwar engin field mine sourc code specif pattern practic softwar evolv version life span effort mine frequent sequenti pattern multipl version softwar substanti reduc effici increment mine problem challeng domain databas updat kind manner includ insert modif remov sequenc mine tool mine constraint low minimum support exist work appli effect due limit work recent work incspan fail solv problem handl low minimum support remov bibnetmin mine bibliograph inform network mine signific graph pattern leap search sampl cube framework statist olap sampl data sampl popular method data collect imposs costli reach entir popul televis show rate unit state gather sampl roughli household result effect sampl partit multidimension space base multipl attribut valu natur lead desir olap onlin analyt process sampl data unlik tradit data sampl data inher uncertain repres full data popul desir return queri result confid interv indic reliabl result segment multidimension space sampl requir addit analysi return trustabl result paper propos sampl cube framework effici calcul confid interv multidimension queri olap structur group similar segment increas sampl size need handl high dimension data sampl cube shell method propos effect reduc storag requir preserv queri result qualiti arcub support rank aggreg queri partial materi data cube support rank queri databas system popular research topic recent lack studi support rank queri data warehous rank multidimension aggreg measur base fact address problem propos queri execut model answer type rank aggreg queri base unifi partial cube structur arcub queri execut model candid gener verif framework promis candid cell gener set high level guid cell identifi bound principl effect prune guid cell prune children candid cell prune address problem effici onlin candid aggreg verif develop chunk base execut model verifi bulk candid bound memori buffer extens perform studi show framework lead order magnitud perform improv state art method flexibl term type rank aggreg queri support dustmin troubleshoot interact complex bug sensor network perrank person rank retriev categor numer attribut olap spatial anomali detect move object recent advanc sensori mobil comput technolog enorm amount data move object collect import applic data autom identif suspici movement due sheer volum data move object challeng develop method effici effect detect anomali problem exacerb fact anomali occur arbitrari level abstract multipl granular spatiotempor featur studi propos framework name roam rule motif base anomali detect move object roam object trajectori express discret pattern fragment call motif featur extract form hierarch featur space facilit multi resolut view data develop gener purpos rulebas classifi explor structur featur space learn effect rule multipl level granular implement roam test compon varieti condit experi show system effici effect detect abnorm move object approxim frequent itemset mine presenc random nois classifi data stream skew class distribut concept drift srda effici algorithm larg dscale discrimin analysi abstract linear discrimin analysi lda popular method extract featur preserv class separ project function lda commonli obtain maxim class covari simultan minim class covari wide field inform process machin learn data mine inform retriev pattern recognit comput lda involv dens matric eigendecomposit computation expens time memori specif lda mnt time complex requir mn mt nt memori number sampl number featur min larg infeas appli lda paper propos algorithm discrimin analysi call spectral regress discrimin analysi srda spectral graph analysi srda cast discrimin analysi regress framework facilit effici comput regular techniqu specif srda solv set regular squar problem eigenvector comput involv huge save time memori theoret analysi show srda comput ms time ms memori averag number nonzero featur sampl extens experiment result real world data set demonstr effect effici algorithm index term linear discrimin analysi spectral regress dimension reduct learn maximum margin subspac imag retriev abstract fundament problem content base imag retriev cbir gap low level visual featur high level semant concept narrow gap relev feedback introduc imag retriev user provid inform classifi learn distinguish posit neg exampl real world applic number user feedback small compar dimension imag space order cope high dimension propos semisupervis method dimension reduct call maximum margin project mmp mmp aim maxim margin posit neg exampl local neighborhood tradit dimension reduct algorithm princip compon analysi pca linear discrimin analysi lda effect global euclidean structur mmp design discov local manifold structur mmp suitabl imag retriev nearest neighbor search involv project imag lower dimension subspac relev imag closer queri imag retriev perform enhanc experiment result corel imag databas demonstr effect propos algorithm index term multimedia inform system imag retriev relev feedback dimension reduct systemat studi failur proxim truth discoveri multipl conflict inform provid web world wide web import inform sourc guarante correct inform web web site provid conflict inform subject specif product paper propos problem call verac conform truth studi find true fact larg amount conflict inform subject provid web site design gener framework verac problem invent algorithm call truthfind util relationship web site inform web site trustworthi piec true inform piec inform true provid trustworthi web site experi show truthfind successfulli find true fact conflict inform identifi trustworthi web site popular search engin systemat studi failur proxim effici identifi max dgap cluster pairwis genom comparison search engin deliv hierarchi web page larg room improv us todai internet search engin wai wai directori subweb web site domain automat retriev mine subdirectori web site similar domain articl outlin methodolog traclass trajectori classif hierarch region dbase trajectori dbase cluster trajectori classif model construct predict class label move object base trajectori featur import real world applic number method report literatur due shape trajectori classif limit classif capabl discrimin featur part trajectori relev shape trajectori situat observ long trajectori spread larg geograph area essenti task effect classif gener discrimin featur featur gener framework traclass trajectori data propos paper gener hierarchi featur partit trajectori explor type cluster region base trajectori base captur higher level region base featur movement pattern captur lower level trajectori base featur movement pattern propos framework overcom limit previou studi trajectori partit make discrimin part trajectori identifi type cluster collabor find featur region trajectori experiment result demonstr traclass gener high qualiti featur achiev high classif accuraci real trajectori data isometr project recent problem dimension reduct receiv lot interest field inform process includ data mine inform retriev pattern recognit case data sampl low dimension manifold embed high dimension euclidean space popular manifold learn algorithm includ local linear embed isomap laplacian eigenmap algorithm nonlinear provid embed result train sampl paper propos linear dimension reduct algorithm call isometr project isometr project construct weight data graph weight discret approxim geodes distanc data manifold linear subspac obtain preserv pairwis distanc algorithm perform origin space reproduc kernel hilbert space lead kernel isometr project isometr project defin compar princip compon analysi pca wide data process algorithm capabl discov intrins geometr structur special pca optim data space linear algorithm assumpt handl complex data space present experiment result algorithm appli synthet data set real life data exampl illustr effect propos method spectral regress unifi subspac learn framework content dbase imag retriev relev feedback establish effect framework narrow gap low level visual featur high level semant concept content base imag retriev tradit implement relev feedback distanc metric classifi learn user provid neg posit exampl due limit user feedback high dimension featur space confront issu curs dimension recent research consid manifold wai address issu local preserv project augment relat embed semant subspac project paper techniqu spectral graph embed regress propos unifi framework call spectral regress learn imag subspac framework facilit analysi differ connect algorithm mention crucial faster comput make retriev system capabl respond user queri effici explor power link data mine spectral regress effici regular subspac learn subspac learn base face recognit method attract consider interest recent year includ princip compon analysi pca linear discrimin analysi lda local preserv project lpp neighborhood preserv embed npe margin fisher analysi mfa disadvantag approach comput involv eigendecomposit dens matric expens time memori paper propos dimension reduct framework call spectral regress sr effici regular subspac learn sr cast problem learn project function regress framework avoid eigen decomposit dens matric regress base framework kind regular natur incorpor algorithm make flexibl comput analysi show sr linear time complex huge speed compar cubic time complex ordinari approach experiment result face recognit demonstr effect effici method regular local preserv index spectral regress problem document index represent recent local preserv index lpi propos learn compact document subspac latent semant index lsi optim sens global euclidean structur lpi optim sens local manifold structur lpi effici time memori make difficult appli larg data set specif comput lpi involv eigen decomposit dens matric expens paper propos algorithm call regular local preserv index rlpi benefit recent progress spectral graph analysi cast origin lpi algorithm regress framework enabl avoid eigen decomposit dens matric regress base framework kind regular natur incorpor algorithm make flexibl extens experiment result show rlpi obtain similar result compar lpi significantli faster make effici effect data preprocess method larg scale text cluster classif retriev learn spatial smooth subspac face recognit subspac learn base face recognit method attract consider interest recent year includ semi dsupervis discrimin analysi linear discrimin analysi lda popular method extract featur preserv class separ project vector commonli obtain maxim class covari simultan minim class covari practic suffici train sampl covari matrix class accur estim paper propos method call semisupervis discrimin analysi sda make label unlabel sampl label data point maxim separ class unlabel data point estim intrins geometr structur data specif aim learn discrimin function smooth data manifold experiment result singl train imag face recognit relev feedback imag retriev demonstr effect algorithm spectral regress effici regular subspac learn subspac learn base face recognit method attract consider interest recent year includ princip compon analysi pca linear discrimin analysi lda local preserv project lpp neighborhood preserv embed npe margin fisher analysi mfa disadvantag approach comput involv eigendecomposit dens matric expens time memori paper propos dimension reduct framework call spectral regress sr effici regular subspac learn sr cast problem learn project function regress framework avoid eigen decomposit dens matric regress base framework kind regular natur incorpor algorithm make flexibl comput analysi show sr linear time complex huge speed compar cubic time complex ordinari approach experiment result face recognit demonstr effect effici method cost dconsciou clean massiv rfid data set effici accur data clean essenti task success deploy rfid system import advanc made tag detect rate common larg number lost read due radio frequenc rf interfer tag reader configur exist clean techniqu focus develop accur method work wide set condit disregard high cost clean real applic thousand reader million tag paper propos clean framework take rfid data set collect clean method cost induc clean plan optim accuracyadjust clean cost determin condit inexpens method expens method absolut multi drelat skylin oper exist work skylin queri extens decis support recommend system focus effici issu singl tabl data retriev user target skylin store multipl tabl requir perform join oper tabl result cost comput skylin join tabl increas dramat due potenti increas cardin dimension paper systemat studi skylin oper multi relat databas propos solut aim seamlessli integr state art join method skylin comput experi demonstr propos method effici show promis applic extend skylin oper typic databas oper join aggreg mine coloss frequent pattern core pattern fusion extens research frequent pattern mine past decad brought number pattern mine algorithm effect effici exist frequent pattern mine algorithm encount challeng mine larg pattern call coloss frequent pattern presenc explos number frequent pattern coloss pattern critic applic domain bioinformat studi investig mine approach call pattern fusion effici find good approxim coloss pattern pattern fusion coloss pattern discov fuse small core pattern step increment pattern growth mine strategi adopt apriori fp growth examin larg number mid size properti distinguish pattern fusion exist frequent pattern mine approach draw mine methodolog empir studi show case current mine algorithm proce pattern fusion mine result set close approxim complet set coloss pattern qualiti evalu model propos paper discrimin frequent pattern analysi effect classif applic frequent pattern classif appear sporad studi achiev initi success classif relat data text document graph paper conduct systemat explor frequent pattern base classif provid solid reason support methodolog featur combin pattern captur underli semant singl featur inclus infrequ pattern significantli improv accuraci due limit predict power build connect pattern frequenc discrimin measur inform gain fisher score develop strategi set minimum support frequent pattern mine gener pattern base strategi coupl propos featur select algorithm discrimin frequent pattern gener build high qualiti classifi demonstr frequent pattern base classif framework achiev good scalabl high accuraci classifi larg dataset empir studi signific improv classif accuraci achiev uci dataset select discrimin frequent pattern integr olap rank rank dcube methodolog assumpt mine data stream analysi practic recent year wit increas number studi stream mine aim build accur model continu arriv data exist work make implicit assumpt train data test data sampl distribut distribut evolv time demonstr true distribut model fit observ distribut unsatisfactori accuraci incom data practic assum bare minimum learn observ data random guess predict class label importantli formal effici kernel discrimin analysi spectral regress linear discrimin analysi lda popular method extract featur preserv class separ project vector commonli obtain maxim class covari simultan minim class covari lda perform origin input space reproduc kernel hilbert space rkh data point map lead kernel discrimin analysi kda data highli nonlinear distribut kda achiev perform lda comput project function kda involv eigen decomposit kernel matrix expens larg number train sampl exist paper present algorithm kernel discrimin analysi call spectral regress kernel discrimin analysi srkda spectral graph analysi srkda cast discrimin analysi regress framework facilit effici comput regular techniqu specif srkda solv set regular regress problem eigenvector comput involv huge save comput cost comput analysi show srkda time faster ordinari kda formul make easi develop increment version algorithm fulli util comput result exist train sampl experi face recognit demonstr effect effici propos algorithm gapprox mine frequent approxim pattern massiv network recent aris larg number graph massiv size complex structur applic biolog network social network web demand power data mine method due inher nois data divers crucial address issu approxim mine pattern potenti interest toler variat paper investig problem mine frequent approxim pattern massiv network propos method call gapprox gapprox find approxim network pattern kei knowledg discoveri applic structur data enrich librari graph mine methodolog introduc techniqu complet redund free strategi explor pattern space face gapprox transform frequent approxim sens anti monoton constraint push deep mine process systemat empir studi real synthet data set show frequent approxim pattern mine worm protein protein interact network biolog interest gapprox effect effici spectral regress unifi approach spars subspac learn recent problem dimension reduct subspac learn receiv lot interest field inform process includ data mine inform retriev pattern recognit popular method includ princip compon analysi pca linear discrimin analysi lda local preserv project lpp disadvantag approach learn project function linear combin origin featur difficult interpret result paper propos dimension reduct framework call unifi spars subspac learn ussl learn spars project ussl cast problem learn project function regress framework facilit kind regular norm regular lasso spars project effici comput experiment result real world classif cluster problem demonstr effect method effici discoveri frequent approxim sequenti pattern propos effici algorithm mine frequent approxim sequenti pattern ham distanc model algorithm gain effici adopt break build methodolog breakdown base observ occurr frequent pattern classifi group call strand develop effici algorithm quickli mine strand iter growth build stage strand group form support set approxim pattern identifi salient featur algorithm abil grow frequent pattern iter assembl build block signific size local search fashion avoid increment growth global search achiev greater effici lose complet mine result experiment studi demonstr algorithm effici mine global repeat approxim sequenti pattern miss exist method index noncrash failur dynam program slice dbase approach local sensit discrimin analysi linear discrimin analysi lda popular data analyt tool studi class relationship data point major disadvantag lda fail discov local geometr structur data manifold paper introduc linear algorithm discrimin analysi call local sensit discrimin analysi lsda suffici train sampl local structur gener import global structur discrimin analysi discov local manifold structur lsda find project maxim margin data point class local area specif data point map subspac nearbi point label close nearbi point label experi carri standard face databas show clear improv result lda base recognit mine index search graph larg data set truth discoveri multipl conflict inform provid web world wide web import inform sourc guarante correct inform web web site provid conflict inform subject specif product paper propos problem call verac conform truth studi find true fact larg amount conflict inform subject provid web site design gener framework verac problem invent algorithm call truthfind util relationship web site inform web site trustworthi piec true inform piec inform true provid trustworthi web site experi show truthfind successfulli find true fact conflict inform identifi trustworthi web site popular search engin mine index search graph larg data set regular regress imag manifold retriev recent consider interest geometr base method imag retriev method imag space smooth manifold appli manifold learn techniqu find euclidean embed euclidean distanc embed space approxim geodes distanc manifold main advantag method relev feedback retriev natur incorpor system prior inform paper retriev problem classif problem manifold learn distanc measur aim learn classif function imag manifold effici kei issu imag retriev web scale propos approach imag retriev manifold approach base regular linear regress framework local manifold structur user provid relev feedback incorpor imag retriev system local preserv regular extens experi carri larg imag databas demonstr effici effect propos approach research frontier advanc data mine technolog applic gprune constraint push framework graph pattern mine abstract graph mine applic increasingli strong urg impos user constraint mine result unlik tradit itemset constraint structur constraint densiti diamet graph hard push deep mine process paper give comprehens studi prune properti tradit structur constraint aim reduc pattern search space data search space gener framework call gprune propos incorpor constraint recurs reinforc entir mine process concept pattern insepar data antimonoton propos handl structur constraint uniqu context graph combin prune properti comprehens unifi classif framework structur constraint explor antimonoton context graph pattern mine signific extens classif constraint deepen understand prune properti structur graph constraint associ mine larg databas dexamin measur abstract literatur data mine statist numer interesting measur propos disclos succinct object relationship associ pattern clear measur effect larg data set recent studi identifi critic properti null transact invari measur event associ larg data set exist measur properti examin null invari measur find interestingli express gener mathemat exist total order order insight underli philosophi measur help understand select proper measur applic gener framework mine concept ddrift data stream skew distribut recent year interest studi predict model data stream studi assum balanc stabl data stream handl skew posit lot neg stochast distribut typic data stream applic paper propos approach mine data stream estim reliabl posterior probabl ensembl model match distribut sampl neg repeat sampl posit formal show interest import properti propos framework reliabl estim probabl skew posit class accuraci estim probabl effici scalabl experi perform synthet real world dataset skew distribut demonstr framework substanti advantag exist approach estim reliabl predic accuraci roam rule motif dbase anomali detect massiv move object data set recent advanc sensori mobil comput technolog enorm amount data move object collect import applic data autom identif suspici movement due sheer volum data move object challeng develop method effici effect detect anomali problem exacerb fact anomali occur arbitrari level abstract multipl granular spatiotempor featur studi propos framework name roam rule motif base anomali detect move object roam object trajectori express discret pattern fragment call motif featur extract form hierarch featur space facilit multi resolut view data develop gener purpos rulebas classifi explor structur featur space learn effect rule multipl level granular implement roam test compon varieti condit experi show system effici effect detect abnorm move object progress select merg comput top dk ad dhoc rank function famili threshold algorithm ta wide studi effici comput top queri ta sort merg framework assum data list pre sort rank function monoton databas applic attribut valu index treestructur indic tree tree rank function necessarili monoton answer top queri ad hoc rank function paper studi index merg paradigm perform progress search space joint state compos multipl index node address challeng effici queri process minim search complex present doubleheap algorithm support progress state search progress state gener avoid unnecessari disk access character type empti state contribut final result propos materi model join signatur prune empti state perform studi show propos method achiev order magnitud speed baselin solut trajectori cluster partit dand dgroup framework exist trajectori cluster algorithm group similar trajectori discov common trajectori kei observ cluster trajectori miss common trajectori discov common trajectori applic region special interest analysi paper propos partit group framework cluster trajectori partit trajectori set line segment group similar line segment cluster primari advantag framework discov common trajectori trajectori databas base partit group framework develop trajectori cluster algorithm tra clu algorithm consist phase partit group phase present formal trajectori partit algorithm minimum descript length mdl principl phase present densiti base line segment cluster algorithm experiment result demonstr traclu correctli discov common trajectori real trajectori data find frequent item data stream hierarch inform effici process subspac skylin queri high dimension data recent studi effici answer subspac skylin queri separ approach focus pre materi set skylin point subspac focu dynam answer queri set anchor prune skylin point spatial reason effort compress pre materi subspac skylin remov redund storag space approach remain exponenti number dimens queri time approach hand grow substanti data higher dimension prune power anchor weaker paper propos method answer subspac skylin queri high dimension data premateri storag queri time moder propos notion maxim partial domin space maxim partial domin space maxim equal space pair skylin object full space concept foundat answer subspac skylin queri high dimension data queri process involv simpl prune oper skylin comput small subset candid skylin point subspac develop random sampl method comput subspac skylin line fashion extens experi conduct demonstr effici effect method traffic densiti dbase discoveri hot rout road network find hot rout traffic flow pattern road network import problem benefici citi planner polic depart real estat develop know hot rout citi direct traffic analyz congest past problem larg address domain knowledg citi recent year detail inform vehicl road network develop adopt rfid locat sensor enorm amount move object trajectori collect find hot rout challeng problem due complex natur data object travel organ cluster straightforward cluster algorithm find hot rout real world object move unpredict wai variat speed time rout factor travel fleet cluster properti make problem difficult naiv approach end propos densiti base algorithm name flowscan cluster move object road segment cluster base densiti common traffic share implement flowscan test condit experi show system effici effect discov hot rout datascop view databas content googl map mine approxim top dk subspac anomali multi ddimension time dseri data market analysi repres data analysi process applic analysi critic numer measur profit sale fluctuat time form time seri data time seri data correspond market segment set attribut ag gender educ incom level product categori form multi dimension structur understand market dynam predict futur trend crucial studi dynam time seri multi dimension market segment topic larg time seri data cube research studi examin issu anomali detect multi dimension time seri data propos timeseri data cube captur multi dimension space form attribut structur facilit detect anomali base expect valu deriv higher level gener time seri anomali detect time seri data cube pose comput challeng high dimension larg data set end propos effici search algorithm iter select subspac origin high dimension space detect anomali experi synthet real world data demonstr effect effici propos solut adapt fastest path comput road network traffic mine approach effici fastest path comput presenc vari speed condit larg scale road network essenti problem modern navig system factor affect road speed weather time dai vehicl type consid order select fast rout match current drive condit exist system comput fastest path base road euclidean distanc small set predefin road speed histori teacher histor traffic data drive pattern simpl euclidean distanc base comput peopl good reason choos rout avoid pass high crime area night encount accid road construct traffic jam paper present adapt fastest path algorithm capabl effici account import drive speed pattern mine larg set traffic data algorithm base observ hierarchi road partit road network area path pre comput strategi area level limit rout search strategi edg path segment frequent travel data driver travers road network largest road distanc trip small road signific speed advantag larg extens experiment evalu real road network show algorithm desir short support rout significantli faster compet method graph contain search index set model graph queri graph contain search aim find model graph due wide adopt graph model fast contain search graph data find applic domain comparison tradit graph search retriev graph contain search index characterist examin paper perform systemat studi characterist propos contrast subgraph base index model call cindex contrast subgraph captur structur differ model graph queri graph perfect index due high select redund awar featur select process cindex sort set signific distinct contrast subgraph maxim index capabl show np complet choos set index featur greedi algorithm approxim level optim index ratio take solut base index model extend accommod hierarch index methodolog appli data space cluster sampl techniqu reduc index construct time propos methodolog gener solut contain search index graph data transit relat experiment result real test data show cindex achiev optim prune power contain search workload confirm obviou advantag indic built tradit graph search scenario tagsmart analysi visual yeast mutant fit data measur tag microarrai compress frequent pattern major challeng frequent pattern mine sheer size mine result compress frequent pattern propos cluster frequent pattern tight measur call cluster select repres pattern cluster problem find minimum set repres pattern shown np hard develop greedi method rpglobal rplocal guarante compress bound higher comput complex sacrific theoret bound effici perform studi show compress qualiti rplocal close rpglobal reduc number close frequent pattern order magnitud rplocal mine faster fpclose fast close frequent pattern mine method show rpglobal rplocal combin balanc qualiti effici frequent pattern mine current statu futur direct crossclu user dguid multi drelat cluster comput iceberg cube top ddown bottom dup integr starcub approach frequent close sequenc mine candid mainten previou studi present convinc argument frequent pattern mine algorithm mine frequent pattern close lead compact complet result set effici previous develop close pattern mine algorithm work candid mainten andtest paradigm inher costli runtim space usag support threshold low pattern long paper present bide effici algorithm mine frequent close sequenc candid mainten adopt sequenc closur check scheme call bi direct extens prune search space deepli compar previou algorithm backscan prune method perform studi spars dens real synthet data set demonstr bide significantli outperform previou algorithm consum order magnitud memori order magnitud faster linearli scalabl term databas size constraint dbase sequenti pattern mine pattern dgrowth method constraint essenti sequenti pattern mine applic systemat studi constraint base sequenti pattern mine paper investig issu point framework develop constrain frequent pattern mine fit mission extend framework develop base sequenti pattern growth methodolog studi show constraint effect effici push deep sequenti pattern mine framework framework extend constraint base structur pattern mine introduct monad structur function program monad provid conveni framework simul ect found languag global state except handl output determin case studi look detail monad eas modi cation simpl evalu monad act basi datatyp arrai subject place updat monad build parser semant annot frequent pattern frequent pattern analyz data fundament approach data mine applic research frequent pattern mine focus develop effici algorithm discov kind frequent pattern attent paid import step interpret discov frequent pattern compress summar frequent pattern studi recent work propos techniqu annot frequent pattern nonsemant inform support limit user understand pattern articl studi problem gener semant annot frequent pattern goal discov hidden mean frequent pattern annot depth concis structur inform propos gener approach gener annot frequent pattern construct context model select inform context indic extract repres transact semant similar pattern gener approach incorpor user prior knowledg potenti applic gener dictionari descript pattern find synonym pattern discov semant relat summar semant class set frequent pattern experi wareh mine massiv rfid data set mine compress commod workflow massiv rfid data set mine index similar search graph complex structur invers classif problem applic research interest gener interest data mine data wareh databas system current research focus model manag analyz larg scale graph inform network data top ddown mine interest pattern high dimension data dcube effici comput close cube aggreg dbase check recogn data cube produc huge output popular effort devot problem iceberg cube signific cell close cube group cell preserv roll drill semant losslessli compress cell due usabl import effici comput close cube warrant studi paper propos measur call closed effici close data cube show closed algebra measur comput effici increment base closed measur develop aggreg base approach call cube close cube integr success iceberg cube algorithm mm cube star cube perform studi show cube run order magnitud faster previou approach studi perform altern algorithm cube vari properti data set wareh analyz massiv rfid data set radio frequenc identif rfid applic set plai essenti role object track suppli chain manag system futur expect major retail rfid system track movement product supplier warehous store backroom eventu point sale volum inform gener system enorm individu item pallet case sku leav trail data move locat departur tradit data cube propos wareh model preserv object transit provid signific compress path depend aggreg base observ item move larg group earli stage system distribut center stage store move smaller group rfid data regist primit level data analysi take place higher abstract level techniqu summar index data method process varieti queri base framework develop studi experi demonstr util feasibl design data structur algorithm search substructur superimpos distanc effici index techniqu develop exact approxim substructur search larg scale graph databas retriev problem structur categor geometr distanc constraint solv paper develop method call pi partit base graph index search support similar search substructur superimpos distanc constraint pi select discrimin fragment queri graph index prune graph violat distanc constraint identifi criterion distinguish select fragment multipl graph develop partit method obtain set highli select fragment improv prune perform experiment result show pi effect process real graph queri bayesian debug ac dclose effici mine approxim close itemset core pattern recoveri recent studi propos method discov approxim frequent itemset presenc random nois relax rigid requir exact frequent pattern mine interest pattern previous fragment exact pattern mine method due random nois measur error successfulli recov larg number uninterest candid explor mine process result relax pattern mine methodolog sever slow mine process wors hard end user distinguish recov interest pattern uninterest paper propos effici algorithm ac close recov approxim close itemset core pattern focus call core pattern integr top mine effect prune strategi algorithm narrow search space potenti interest experiment result show ac close substanti outperform previous propos method term effici deliv similar set interest recov pattern motion dalert automat anomali detect massiv move object abstract recent advanc sensori mobil comput technolog enorm amount data move object collect data automat identifi suspici behavior object movement anomali detect massiv move object import applic surveil law enforc homeland secur due sheer volum spatiotempor spatial data weather object type move object challeng develop method effici effect detect anomali object movement complex scenario problem complic fact anomali occur level abstract time locat granular paper analyz problem anomali detect move object propos effici scalabl classif method call motion classifi proce step object movement featur call motif extract object path path consist sequenc motif express valu relat time locat discov anomali object movement motif base gener perform cluster similar object movement fragment gener movement base motif motif base gener object put multi level featur space classifi classifi handl highdimension featur space implement method core compon move object anomali detect system motion alert experi show system accur tradit classif techniqu gener semant annot frequent pattern context analysi fundament data mine task frequent pattern mine widespread applic domain research frequent pattern mine focus develop effici algorithm discov kind frequent pattern attent paid import step interpret discov frequent pattern recent work studi compress summar frequent pattern propos techniqu annot frequent pattern semant inform support limit user understand pattern paper propos problem gener semant annot frequent pattern goal annot frequent pattern depth concis structur inform hidden mean pattern propos gener approach gener annot frequent pattern construct context model select inform context indic extract repres transact semant similar pattern gener approach potenti applic gener dictionarylik descript pattern find synonym pattern discov semant relat summar semant class set frequent pattern experi dataset show approach effect gener semant pattern annot extract redund dawar top dk pattern discov interest pattern user interact feedback gplag detect softwar plagiar program depend graph analysi blossom open sourc project conveni softwar plagiar compani disciplin tempt plagiar open sourc project product current plagiar detect tool suffici academ short fight plagiarist disguis statement reorder code insert effect confus tool paper develop plagiar detect tool call gplag detect plagiar mine program depend graph pdg pdg graphic represent data control depend procedur pdg invari plagiar gplag effect state art tool plagiar detect order make gplag scalabl larg program statist lossi filter propos prune plagiar search space experi studi show gplag effect effici detect plagiar easili slip exist tool take second find simul plagiar program thousand line code rank outlier symmetr neighborhood relationship abstract mine outlier databas find except object deviat rest data set classic outlier analysi algorithm recent studi focus mine local outlier outlier densiti distribut significantli neighborhood estim densiti distribut locat object base densiti distribut nearest neighbor outlier locat densiti distribut neighborhood significantli case object spars cluster close denser cluster result wrong estim avoid problem propos simpl effect measur local outlier base symmetr neighborhood relationship propos measur consid neighbor revers neighbor object estim densiti distribut result outlier discov meaning comput local outlier effici mine algorithm develop detect top outlier base definit comprehens perform evalu analysi show method effici comput effect rank outlier mine control flow abnorm logic error isol mine interest pattern high dimension data top ddown row enumer approach tensor space model document analysi vector space model vsm core inform retriev past decad vsm consid document vector high dimension space vector space techniqu latent semant index lsi support vector machin svm naiv bay appli index classif case dimension document space extrem larg make techniqu infeas due curs dimension paper propos tensor space model document analysi repres document order tensor matric correspondingli index algorithm call tensor latent semant index tensorlsi develop tensor space theoret analysi show tensorlsi computation effici convent latent semant index make applic extrem larg scale data set experiment result standard document data set demonstr effici effect algorithm categori subject descriptor rank object base relationship text corpora enhanc addit metadata relat real world entiti document entiti discuss relationship typic obtain wide inform extract tool time interest associ typic hold entiti instanc corpu discuss hotel citi airlin fix associ entiti includ airlin oper flight citi hotel locat citi plethora applic necessit identif entiti match set keyword sampl queri find holidai packag pet friendli hotel locat histor live citi travel oper econom safe airlin keyword occur textual descript entiti actual hotel citi airlin answer queri exploit relationship entiti document keyword pet friendli occur document entiti hotel associ entiti hotel locat citi work focu class entiti packag finder queri outlin demonstr exist techniqu effici adapt solv problem result algorithm reli estim excess runtim storag overhead propos effici algorithm process queri larg corpora devis earli prune termin strategi presenc join aggreg execut entiti extract text depend estim analysi experiment evalu real synthet data demonstr effici scalabl approach failur proxim fault local dbase approach recent softwar system featur autom failur report system huge number fail trace collect dai order priorit fault diagnosi fail trace due fault expect group previou method hypothes similar fail trace impli fault cluster fail trace base liter trace similar call trace proxim fault trigger wai fail trace due fault previou method group trace exhibit similar behavior similar branch coverag trace due fault paper propos type failur proxim call proxim fail trace similar suggest roughli fault locat fault locat fail case suggest automat obtain sober exist statist debug tool show proxim fail trace due fault group addit find proxim help statist debug develop interpret util statist debug result illustr usag proxim case studi grep program experi siemen suit result demonstr advantag proxim trace proxim robust index rank queri research interest gener interest data mine data wareh databas system current research focus model manag analyz larg scale graph inform network data linkclu effici cluster heterogen semant link data object relat databas cross link multi type link link rich semant inform import relationship object current cluster method reli properti belong object se similar object link desir cluster gener properti object paper explor linkag base cluster similar object measur base similar object link comparison previou studi simrank comput link recurs pair object advantag power law distribut link develop hierarch structur call simtre repres similar multi granular manner method avoid high cost comput store pairwis similar explor relationship object effici algorithm propos comput similar object avoid pairwis similar comput merg comput branch simtre experi show propos approach achiev high effici scalabl accuraci cluster multi type link object answer top dk queri multi ddimension select rank cube approach observ real applic top queri consist compon reflect user prefer select condit rank function user propos ad hoc rank function interest subset data case user studi data initi multi dimension analysi top queri result previou work top queri process focus optim data access rank function problem effici answer top queri multidimension select address paper propos comput model call rank cube effici answer top queri multidimension select defin rank awar measur cube captur goal respond multidimension rank analysi base rank cube effici queri algorithm develop progress retriev data block top result found curs dimension challeng data cube cope difficulti introduc techniqu rank fragment experi microsoft sql server show propos approach signific improv previou method flowcub constructu rfid flowcub multi ddimension analysi commod flow error dadapt time dawar mainten frequenc count data stream abstract maintain frequenc count item data stream wide rang applic web advertis fraud detect studi problem attract great attent research practition algorithm propos paper propos method error adapt prune method maintain frequenc accur propos method call fraction record time inform frequenc inform method design algorithm find frequent item top frequent item experiment result show method effect term improv mainten accuraci featur dbase similar search graph structur similar search complex structur import oper graph relat applic exact match restrict articl investig issu substructur similar search index featur graph databas transform edg relax ratio queri graph maximum allow featur miss structur filter algorithm filter graph perform pairwis similar comput shown featur result poor filter perform challeng design effect featur set select strategi maxim filter capabl prove complex optim featur set select worst case number featur select practic identifi criteria build effect featur set filter demonstr combin featur similar size select improv filter search perform significantli multi filter composit framework propos featur base filter concept gener appli search approxim consecut sequenc tree structur data categori subject descriptor databas manag system queri process preliminari releas articl accept acm transact databas system definit version product acm releas supersed version integr arrai analyz softwar packag analysi cross dplatform cross dspeci microarrai data erratum push convert constraint frequent itemset mine recent work highlight import constraint base mine paradigm context frequent itemset associ correl sequenti pattern interest pattern larg databas paper studi constraint handl exist theori techniqu item arbitrari valu amp customarili regard tough constraint push insid algorithm apriori develop notion convert constraint systemat analyz classifi character class develop techniqu enabl readili push deep insid recent develop fp growth algorithm frequent itemset mine result detail experi show effect techniqu develop introduct recogn frequent pattern minin regress cube lossless compress aggreg abstract olap engin wide support multidimension data analysi desir support data cube advanc statist measur regress filter addit tradit simpl measur count averag measur user model smooth predict trend pattern data exist algorithm simpl distribut algebra measur inadequ effici comput statist measur multidimension space paper propos fundament class measur compress measur order support effici comput statist model compress measur compress cell auxiliari matrix size independ number tupl comput statist measur data cell compress data lower level cell access raw data time space effici lossless aggreg formula deriv regress filter measur analyt experiment studi show result system regress cube substanti reduc memori usag respons time statist analysi multidimension data index term aggreg compress data cube olap framework ddemand classif evolv data stream close constrain gradient mine retail databas effici classif multipl databas relat crossmin approach statist debug hypothesi test dbase approach abstract manual debug tediou costli high cost motiv develop fault local techniqu develop search fault locat paper propos statist method call sober automat local softwar fault prior knowledg program semant unlik exist statist approach select predic correl program failur sober model predic evalu correct incorrect execut predic fault relev evalu pattern incorrect execut significantli diverg correct featur rational similar hypothesi test sober quantifi fault relev predic principl systemat evalu sober set previou studi result demonstr effect sober develop locat fault siemen suit examin percent code transit approach propos holger al statist approach liblit al locat fault effect sober evalu imperfect world test suit inadequ partial label experi sober achiev competit qualiti harsh circumst case studi grep bc report shed light applic sober larg program index term debug aid statist method statist debug orthogon laplacianfac face recognit patrascu buzuloiu imag dynam rang enhanc imag cluster tensor represent sober statist model dbase bug local mine close relat graph connect constraint mine close relat graph connect constraint mine evolv custom dproduct relationship multi ddimension space previou work mine transact databas focus primarili mine frequent itemset associ rule sequenti pattern interest relationship custom item evolut time studi paper propos gaussin transform base regress model captur time variant relationship custom product interest discov relationship multi dimension space effici method develop comput multi dimension aggreg curv data cube environ experiment result demonstr promis approach mine coher dens subgraph massiv biolog network function discoveri summar itemset pattern profil dbase approach frequent pattern mine studi extens scalabl method mine kind pattern includ itemset sequenc graph bottleneck frequent pattern mine effici interpret due huge number pattern gener mine process paper examin summar collect itemset pattern repres small number pattern user handl easili repres cover frequent pattern approxim support gener model built extract profil repres support pattern easili recov consult origin dataset base restor error propos qualiti measur function determin optim paramet polynomi time algorithm develop optim heurist effici improv empir studi obtain compact summar real dataset mine close relat graph connect constraint cross drelat cluster user guidanc parallel mine close sequenti pattern discoveri sequenti pattern essenti data mine task broad applic variat sequenti pattern close sequenti pattern retain inform complet pattern set compact parallel close sequenti pattern mine method propos paper develop algorithm call par csp parallel close sequenti pattern mine conduct parallel mine close sequenti pattern distribut memori system par csp partit work processor exploit divid conquer properti overhead interprocessor commun minim par csp appli dynam schedul avoid processor idl emploi techniqu call select sampl address load imbal problem implement par csp mpi node linux cluster experiment result show par csp attain good parallel effici input dataset effici classif multipl heterogen databas fast expans comput network inevit studi data mine heterogen databas paper propos mdbm accur effici approach classif multipl heterogen databas propos regress base method predict us inter databas link serv bridg inform transfer link automat detect valid high cost inter databas commun mdbm emploi strategi cross databas classif find perform action high benefit cost ratio experi show mdbm achiev high accuraci cross databas classif higher effici previou approach commun mine multi drelat network abstract social network analysi attract attent recent year commun mine major direct social network analysi exist method commun mine assum kind relat network mine result independ user prefer realiti exist multipl heterogen social network repres kind relationship kind relationship plai distinct role task paper systemat analyz problem mine hidden commun heterogen social network base observ relat import respect queri propos method learn optim linear combin relat meet user expect obtain relat perform achiev commun mine effici process rank queri sweep select abstract exist method top rank queri emploi techniqu includ sort updat threshold materi view paper propos index base techniqu top rank queri index layer skylin index microclust object grid structur develop effici algorithm rank queri locat answer point sweep line hyperplan score function index object method easili plug typic multi dimension databas index comprehens experi demonstr method outperform exist illustr applic data mine techniqu microclust effect solut databas queri process sampl dbase framework parallel data mine goal data mine algorithm discov inform embed larg databas frequent itemset mine sequenti pattern mine import data mine problem broad applic effici solv problem sequenti appli pattern growth algorithm divid conquer algorithm paper present framework parallel mine frequent itemset sequenti pattern base divid conquer strategi pattern growth discuss load balanc problem introduc sampl techniqu call select sampl address problem implement parallel version frequent itemset sequenti pattern mine algorithm framework experiment result show parallel algorithm achiev excel speedup categori subject descriptor program techniqu concurr program parallel program databas manag mine behavior graph backtrac noncrash bug analyz execut buggi softwar program essenti data mine process interest method develop trace crash bug memori violat core dump difficult analyz noncrash bug logic error paper develop method classifi structur trace program execut softwar behavior graph analyz correct incorrect execut made good progress isol program region lead faulti execut classif framework built integr close graph mine svm classif interestingli suspici region identifi captur classif accuraci chang measur increment program execut perform studi case base experi show approach effect effici seqindex index sequenc sequenti pattern analysi paper studi issu relat design construct high perform sequenc index structur larg sequenc databas build effect indic method call seqindex propos select indic base analysi discrimin frequent sequenti pattern mine larg sequenc databas analysi lead construct compact effect index structur elimin requir set optim support threshold difficult user provid practic discrimin frequent pattern base index method proven effect base perform studi substructur similar search graph databas advanc databas system face great challeng rais emerg massiv complex structur data bioinformat chem informat applic fundament support need applic effici search complex structur data exact match restrict similar search complex structur vital oper support effici paper investig issu substructur similar search index featur graph databas transform edg relax ratio queri graph maximum allow miss featur structur filter algorithm call grafil filter graph perform pairwis similar comput shown featur result poor filter perform challeng design effect featur set select strategi filter examin effect featur select mechan develop multi filter composit strategi filter distinct complementari subset featur identifi criteria form effect featur set filter demonstr combin featur similar size select improv filter search perform significantli concept present grafil appli search approxim consecut sequenc tree complic structur graphmin structur pattern dmine system larg disk dbase graph databas applic search relat object relat databas discov knowledg retriev inform relat databas user find object relat sourc object main challeng build ectiv object search system huge amount object databas larg number di erent relationship object paper introduc ross cient accur relat object search system ross accept complex queri enabl user relationship object measur relationship join path ross consid di erent semant di erent join combin select length join path measur strength approach find join path relat convert databas schema graph shortest path graph correspond join path databas ross stream base system architectur handl complex queri logic oper find relat object user request comprehens experi conduct show high scalabl ectiv ross mine compress frequent dpattern set major challeng frequent pattern mine sheer size mine result case high min threshold discov commonsens pattern low gener explos number output pattern sever restrict usag paper studi problem compress frequent pattern set typic frequent pattern cluster tight measur call cluster repres pattern select cluster find minimum set repres pattern np hard develop greedi method rpglobal rplocal guarante compress bound higher comput complex sacrific theoret bound effici perform studi show compress qualiti rplocal close rpglobal reduc number close frequent pattern order magnitud rplocal mine faster fpclose fast close frequentpattern mine method show rpglobal rplocal combin balanc qualiti effici survei biodata analysi data mine perspect mine data stream abstract mine data stream rais number research challeng data mine commun challeng includ limit comput resourc mine stream data mobil devic limit resourc due continu data stream algorithm pass incom data record articl algorithm output granular aog approach mine data stream discuss aog adapt approach cope challeng inher featur data stream show result aog base cluster resourc constrain environ graph index base discrimin frequent structur analysi high dimension project cluster data stream make svm scalabl larg data set hierarch cluster index support vector machin svm promis method classif regress analysi due solid mathemat foundat includ desir properti margin maxim linear classif kernel promin properti svm chosen larg scale data mine problem train complex highli depend data set size unlik tradit pattern recognit machin learn real world data mine applic involv huge num ber data record expens perform multipl scan entir data set infeas put data set memori paper present method cluster base svm cb svm maxim svm perform larg data set limit amount resourc memori cb svm appli hierarch micro cluster algorithm scan entir data set provid svm high qualiti sampl sampl carri statist summari data maxim benefit learn analys show train complex cb svm quadrat depend number support vector entir data set experi synthet real world data set show cb svm highli scalabl larg data set accur term classif stream cube architectur multi ddimension analysi data stream document cluster local preserv index abstract propos document cluster method aim cluster document semant class document space gener high dimension cluster high dimension space infeas due curs dimension local preserv index lpi document project lower dimension semant space document relat semant close previou document cluster method base latent semant index lsi nonneg matrix factor nmf method discov geometr discrimin structur document space theoret analysi method show lpi unsupervis approxim supervis linear discrimin analysi lda method intuit motiv method extens experiment evalu perform reuter tdt data set index term document cluster local preserv index dimension reduct semant divid dand dapproxim constraint push strategi iceberg cube mine tfp effici algorithm mine top dk frequent close itemset abstract frequent itemset mine studi extens literatur previou studi requir specif min support threshold aim mine complet set frequent itemset satisfi min support practic difficult user provid min support threshold addit complet set frequent itemset compact set frequent close itemset paper propos altern mine task mine top frequent close itemset length min desir number frequent close itemset mine min minim length itemset effici algorithm call tfp develop mine itemset min support start min support make length constraint properti top frequent close itemset min support rais effect fp tree prune dynam construct tree propos method close node count descend sum mine speed emploi top bottom combin fp tree travers strategi set search space prune method fast level hash index result tree close itemset verif scheme extens perform studi show tfp high perform linear scalabl term databas size index term data mine frequent itemset associ rule mine method algorithm tsp mine top dk close sequenti pattern sequenti pattern mine studi extens data mine commun previou studi requir specif minimum support threshold perform mine difficult user provid threshold practic overcom difficulti propos altern task mine top frequent close sequenti pattern length desir number close sequenti pattern mine minimum length pattern mine close pattern compact represent frequent pattern tribut professor hongjun lu crossmin effici classif multipl databas relat todai structur data store relat databas databas consist multipl relat link conceptu entiti relationship link design relat databas schema multi relat classif wide disciplin financi decis make medic research geograph applic classif approach work singl flat data relat difficult convert multipl relat singl flat relat introduc huge undesir univers relat lose essenti inform previou work induct logic program approach recent relat mine proven effect high accuraci multi relat classif suffer poor scalabl number relat number attribut databas mine complex match web queri interfac crossmin effici classif multipl databas relat todai structur data store relat databas databas consist multipl relat link conceptu entiti relationship link design relat databas schema multi relat classif wide disciplin financi decis make medic research geograph applic classif approach work singl flat data relat difficult convert multipl relat singl flat relat introduc huge undesir univers relat lose essenti inform previou work induct logic program approach recent relat mine proven effect high accuraci multi relat classif suffer poor scalabl number relat number attribut databas bide effici mine frequent close sequenc previou studi present convinc argument frequent pattern mine algorithm mine frequent pattern close lead compact complet result set effici previous develop close pattern mine algorithm work candid mainten test paradigm inher costli runtim space usag support threshold low pattern long scalabl construct topic directori nonparametr close termset mine discov complex match web queri interfac correl mine approach enabl inform integr schema match critic step discov semant correspond attribut heterogen sourc complex match common complex search space exist techniqu focu simpl match tackl challeng paper take conceptu approach view schema match correl mine task match web queri interfac integr myriad databas internet deep web queri interfac gener form complex match attribut group correspond book domain observ cooccurr pattern queri interfac reveal complex semant relationship group attribut tend present queri interfac posit correl contrast synonym attribut neg correl rare occur insight enabl discov complex match correl mine approach develop dcm framework consist data prepar dual mine posit neg correl final match select unlik previou correl mine algorithm focu find strong posit correl algorithm care posit neg correl subtleti neg correl due special import schema match lead introduct correl measur measur distinct propos previou work evalu approach extens result show good accuraci discov complex match demand classif data stream current model classif problem ectiv handl burst class come time fact current model classif problem simpli concentr method pass classif model larg data set model data stream classif view data stream classif problem point view dynam approach simultan train test stream dynam classif data set model reflect real life situat ectiv desir classifi test stream real time evolv train test stream aim creat classif system train model adapt quickli underli data stream order achiev goal propos demand classif process dynam select window past train data build classifi empir result system maintain high classif accuraci evolv data stream provid cient solut classif task incspan increment mine sequenti pattern larg databas real life sequenc databas grow increment undesir mine sequenti pattern scratch time small set sequenc grow sequenc ad databas increment algorithm develop sequenti pattern mine mine adapt increment databas updat nontrivi mine sequenti pattern increment exist sequenc grow increment growth lead gener pattern due interact grow subsequ origin studi develop effici algorithm incspan increment mine sequenti pattern explor interest properti perform studi show incspan outperform previous propos increment algorithm increment wide margin cluster move object mine scale dfree network geodes cluster real world graph shown scale free vertex degre follow power law distribut vertic tend cluster averag length shortest path small present model understand scale free network base multilevel geodes approxim data structur call multilevel mesh ccmine effici mine confid dclose correl pattern correl pattern mine increasingli import recent altern augment associ rule mine correl pattern mine mine thick skylin larg databas abstract peopl recent interest oper call skylin return object domin object regard measur multi dimension space recent work skylin oper focus effici comput skylin larg databas work user thin skylin singl object desir real applic paper propos concept call thick skylin recommend skylin object nearbi neighbor distanc effici comput method develop includ effici algorithm sampl prune index estim find thick skylin statist index larg databas highli effici microclust base algorithm mine thick skylin microclusterbas method lead substanti save comput concis represent thick skylin case high cardin experiment perform studi show propos method effici effect graph index frequent structur dbase approach graph increasingli import model complic structur schemaless data protein chemic compound xml document graph queri desir retriev graph quickli larg databas graph base indic paper investig issu index graph propos solut appli graph mine techniqu di erent exist path base method approach call gindex make frequent substructur basic index featur frequent substructur ideal candid explor intrins characterist data stabl databas updat reduc size index structur techniqu size increas support constraint discrimin fragment introduc perform studi show gindex time smaller index size achiev time perform comparison typic path base method graphgrep gindex approach eleg solut graph index problem demonstr databas index queri process benefit data mine frequent pattern mine concept develop appli index sequenc tree complic structur maid mine alarm incid data stream real time surveil system network telecommun system dynam process gener tremend potenti infinit volum stream data effect analysi stream data pose great challeng databas data mine research due uniqu featur singl scan algorithm multi dimension onlin analysi fast respons time continu dnearest neighbor search move object paper describ method continu monitor nearest neighbor object mobil environ monitor nearest neighbor choos monitor nearest neighbor condit knn chang neighbor addit origin space move object transform time distanc td space object repres curv beach line algorithm develop monitor chang neighbor enabl maintain knn increment extens empir studi show beach line algorithm outperform effici exist algorithm wide margin total number object larg mm dcube comput iceberg cube factor lattic space data cube iceberg cube comput problem studi research major approach develop direct top comput repres multiwai arrai aggreg util share comput perform dens data set bottom comput repres buc take advantag apriori prune perform spars data set integr top bottom comput repres starcub take advantag high perform case perform star cube degrad spars data set due addit cost introduc tree structur approach achiev uniformli high perform kind data set high ddimension olap minim cube approach data cube plai essenti role fast olap onlin analyt process multi dimension data warehous framework project cluster high dimension data stream data stream problem studi extens recent year great eas collect stream data natur stream data make essenti algorithm requir pass data recent singl scan stream analysi method propos context mine frequent pattern candid gener frequent dpattern tree approach mine frequent pattern transact databas time seri databas kind databas studi popularli data mine research previou studi adopt apriori candid set gener test approach candid set gener costli exist larg number pattern long pattern studi propos frequent pattern tree fp tree structur extend prefix tree structur store compress crucial inform frequent pattern develop effici fp tree base mine method fp growth mine complet set frequent pattern pattern fragment growth effici mine achiev techniqu larg databas compress condens smaller data structur fp tree avoid costli repeat databas scan fp tree base mine adopt pattern fragment growth method avoid costli gener larg number candid set partit base divid conquer method decompos mine task set smaller task mine confin pattern condit databas dramat reduc search space perform studi show fp growth method effici scalabl mine long short frequent pattern order magnitud faster apriori algorithm faster recent report frequent pattern mine method push convert constraint frequent itemset mine pebl web page classif neg exampl web page classif essenti techniqu web mine classifi web page interest class step mine web construct classifi interest class requir labori preprocess collect posit neg train exampl instanc order construct homepag classifi collect sampl homepag posit exampl sampl nonhomepag neg exampl collect neg train exampl requir arduou work caution avoid bia paper present framework call posit base learn pebl web page classif elimin manual collect neg train exampl preprocess pebl framework appli algorithm call map converg achiev high classif accuraci posit unlabel data high tradit svm posit neg data run stage map stage converg stage map stage algorithm weak classifi draw initi approxim strong neg data base initi approxim converg stage iter run intern classifi svm maxim margin progress improv approxim neg data class boundari eventu converg true boundari posit class featur space present algorithm support theoret experiment justif experi show set posit exampl algorithm outperform class svm accur tradit svm mine sequenti pattern pattern dgrowth prefixspan approach sequenti pattern mine import data mine problem broad applic difficult problem mine gener examin combinatori explos number intermedi subsequ previous develop sequenti pattern mine method gsp explor candid gener test approach reduc number candid examin approach effici mine larg sequenc databas numer pattern long pattern paper propos project base sequenti pattern growth approach effici mine sequenti pattern approach sequenc databas recurs project set smaller project databas sequenti pattern grown project databas explor local frequent fragment base initi studi pattern growth base sequenti pattern mine freespan propos effici method call psp offer order growth reduc project databas improv perform pseudoproject techniqu develop prefixspan comprehens perform studi show prefixspan case outperform priori base algorithm gsp freespan spade sequenti pattern mine algorithm adopt vertic data format prefixspan integr pseudoproject fastest test algorithm mine methodolog extend mine sequenti pattern user constraint high promis pattern growth approach lead extens effici mine kind frequent pattern frequent substructur mine constrain gradient larg databas data analysi task view search mine multidimension space md mdss dimens captur potenti import factor applic cell repres combin valu factor systemat analyz data md terest notion call cubegrad recent introduc imielinski al ika focus notabl measur md compar cell refer probe cell gradient cell ancestor descend sibl call queri gradient analysi queri gq md billion cell import answer gq effici studi focu develop effici method mine gq constrain weakli anti monoton constraint conduct independ gradient cell search probe cell ineffici due repeat work propos effici algorithm liveset driven algorithm find good gradient probe cell pair search pass util measur analysi dimens match analysi set orient manner achiev bi direct prune set hope probe cell hope gradient cell adopt hyper tree structur cube sequenti pattern mine structur pattern mine pattern dgrowth approach mine condens frequent dpattern base frequent pattern mine studi extens effect effici mine limit number frequent pattern gener larg applic suffici gener examin frequent pattern support frequenc close approxim full precis compact close frequent pattern base call condens frequent pattern base sigkdd workshop mine tempor sequenti data kdd ftdm text classif posit unlabel document exist studi text classif assum train data complet label realiti inform retriev problem accur learn binari classifi set incomplet label exampl typic small number label posit exampl larg number unlabel exampl paper studi problem perform text classif label neg data tc won paper explor effici extens standard support vector machin svm approach call svmc support vector map converg tc won task analys show posit train data sampl svmc significantli outperform method svmc basic exploit natur gap posit neg document featur space eventu correspond improv gener perform text domain exist gap featur space document map spars high dimension featur space number posit train data decreas boundari svmc start overfit point end gener poor result posit train data boundari iter trespass natur gap posit neg class featur space end fit tightli posit train data discov compact highli discrimin featur featur combin drug activ support vector machin nowadai high throughput experiment techniqu make feasibl examin collect massiv data molecular level data typic map high dimension featur space carri rich inform function chemic biolog entiti infer valuabl knowledg purpos classif predict typic small number featur featur combin plai determin role function discrimin identif featur featur combin great import paper studi problem discov compact highli discrimin featur featur combin rich featur collect emploi support vector machin classif mean aim find compact featur combin compar previou method featur select identifi featur sole base individu role classif method identifi minim featur combin ultim determin role systemat fashion experiment studi drug activ data show method discov descriptor necessarili signific individu signific collect mine typic prefer collabor user group push aggreg constraint divid dand dapproxim iceberg cube mine comput group partit group dimens list satisfi aggreg constraint previou work push anti monoton constraint iceberg cube mine constraint anti monoton paper propos strategi push gener aggreg constraint call divid approxim strategi divid search space approxim constraint subspac pushabl constraint strategi recurs appli approxim approach constraint prune tight show constraint defin sql aggreg arithmet oper comparison oper push divideand approxim present effici implement import subclass evalu synthet real life databas tsp mine top dk close sequenti pattern sequenti pattern mine studi extens data mine commun previou studi requir specif minimum support threshold perform mine difficult user provid threshold practic overcom difficulti propos altern task mine top frequent close sequenti pattern length desir number close sequenti pattern mine minimum length pattern mine close pattern compact represent frequent pattern comin effici mine correl pattern associ rule mine gener huge number rule major redund reflect true correl relationship data object paper examin problem show interest measur confid denot coher denot disclos genuin correl relationship comput cientli propos interest algorithm comin comin base extens pattern growth methodolog perform studi show comin algorithm high perform comparison apriori base counterpart algorithm object match inform integr profil dbase approach object match fundament problem aris numer inform integr scenario virtual exist solut problem assum object match share set attribut match compar similar attribut mine concept ddrift data stream ensembl classifi recent mine data stream concept drift action insight import challeng task wide rang applic includ credit card fraud protect target market network intrus detect convent knowledg discoveri tool face challeng overwhelm volum stream data concept drift paper propos gener framework mine concept drift data stream weight ensembl classifi train ensembl classif model ripper naiv bayesian sequenti chunk data stream classifi ensembl judici weight base expect classif accuraci test data time evolv environ ensembl approach improv effici learn model accuraci perform classif empir studi show propos method substanti advantag singl classifi approach predict accuraci ensembl framework effect varieti classif model closet search strategi mine frequent close itemset mine frequent close itemset complet nonredund result frequent pattern analysi extens studi propos strategi effici frequent close itemset mine depth search breadthfirst search vertic format horizont format treestructur data structur top bottomup travers pseudo project physic project condit databas time pro con strategi pick integr strategi achiev higher perform gener case studi answer question systemat studi search strategi develop win algorithm closet closet integr advantag previous propos effect strategi newli develop perform studi synthet real data set shown advantag strategi improv closet exist mine algorithm includ closet charm op term runtim memori usag scalabl closegraph mine close frequent graph pattern categori subject descriptor classifi larg data set svm hierarch cluster data mine bio ddata analysi jiawei han depart comput scienc univers illinoi urbana champaign hanj cs uiuc abstract recent progr data mine re led develop numer cient and calabl method mine inter pattern largedataba time recent progr biologi medicalsicalwc dna technologyha led accumul oftremend amount bio medic data demand depth analyshw que howto bridg field data mine bioinformat sww mine bio medic data absw analyz ho data mine bio medic data analysc outlinesli re problem motiv develop data mine tool bio data analysaw keyword bio medic data anali data mine bioinformat data mine applic re challeng cpar classif base predict associ rule recent studi data mine propos classif approach call associ classif report achiev higher classif accuraci tradit classif approach approach su er major defici gener larg number associ rule lead high process overhead confid base rule evalu measur lead overfit clospan mine close sequenti pattern larg databas star dcube comput iceberg cube top ddown bottom dup integr data cube comput essenti expens oper data wareh previou studi developedtwo major approach top bottomup repres multiwai arrai cube call multiwai algorithm aggreg simultan multipledimens framework cluster evolv data stream cluster problem difficult problem data stream domain larg volum data arriv stream render tradit algorithm ineffici recent year profil dbase object match inform integr match method reli similar share attribut profil base object match build approach correl disjoint attribut improv match accuraci effici mine intertransact associ rule push support constraint associ rule mine interest pattern occur vari level support classic associ mine base uniform minimum support apriori miss interest pattern low support suffer bottleneck itemset gener caus low minimum support solut li exploit support constraint minimum support requir itemset itemset gener paper present framework frequent itemset mine presenc support constraint approach push support constraint apriori itemset gener minimum support determin itemset run time preserv essenc apriori strategi call adapt apriori experi show adapt apriori highli effect deal bottleneck itemset gener keyword associ rule constraint data mine frequent itemset knowledg discoveri cancer classif gene express data classif tumor type great import cancer diagnosi drug discoveri previou cancer classif studi clinic base limit diagnost abil cancer classif gene express data kei address fundament problem relat cancer diagnosi drug discoveri recent advent dna microarrai techniqu made simultan monitor thousand gene express abund gene express data research start explor possibl cancer classif gene express data number method propos recent year promis result lot issu address understood order gain deep insight cancer classif problem closer problem propos solut relat issu survei paper present comprehens overview propos cancer classif method evalu base comput time classif accuraci abil reveal biolog meaning gene inform introduc evalu propos gene select method integr preprocess step cancer classif order obtain full pictur cancer classif discuss issu relat cancer classif includ biolog signific statist signific cancer classifi asymmetr classif error cancer classifi gene contamin problem proceed siam intern confer data mine data mine bio ddata analysi jiawei han depart comput scienc univers illinoi urbana champaign hanj cs uiuc abstract recent progr data mine re led develop numer cient and calabl method mine inter pattern largedataba time recent progr biologi medicalsicalwc dna technologyha led accumul oftremend amount bio medic data demand depth analyshw que howto bridg field data mine bioinformat sww mine bio medic data absw analyz ho data mine bio medic data analysc outlinesli re problem motiv develop data mine tool bio data analysaw keyword bio medic data anali data mine bioinformat data mine applic re challeng mine sequenti pattern constraint larg databas constraint essenti sequenti pattern mine applic systemat studi constraint base sequenti pattern mine paper investig issu point framework develop constrain frequent pattern mine fit mission extend framework develop base sequenti pattern growth methodolog studi show constraint effect effici push deep sequenti pattern mine framework framework extend constraint base structur pattern mine onlin analyt process stream data feasibl real time surveil system dynam environ ment gener tremend potenti infinit vol um stream data volum huge scan multipl time data resid low level abstract analyst interest dynam trend outlier high level abstract discov high level characterist perform line multi level analysi stream data similar olap line analyt process relat data warehous data profit mine pattern action major obstacl data mine applic gap statist base pattern extract base decis make present profit mine approach reduc gap profit mine set past transact pre select target item build model recommend target item promot strategi custom goal maxim net profit identifi issu profit mine propos solut mine top dk frequent close pattern minimum support paper propos mine task mine top frequent close pattern length min desir number frequent close pattern mine min minim length pattern effici algorithm call tfp develop mine pattern minimum support method close node count descend sum propos effect rais support threshold prune fp tree construct fp tree mine process top bottom combin fp tree mine strategi develop speed support rais close frequent pattern discov addit fast hash base close pattern verif scheme emploi check effici potenti close pattern close comput condens frequent pattern base frequent pattern mine studi extens effect effici mine limit number frequent pattern gener larg applic suffici gener examin frequent pattern support frequenc close approxim full precis compact close frequent pattern base call condens frequent pattern base heterogen learner web page classif classif interest class web page person homepag resum page interest problem typic machin learn algorithm problem requir class data train posit neg train exampl applic web page classif gather unbias sampl neg exampl appear difficult propos heterogen learn framework classifi web page elimin neg train data increas classif accuraci heterogen learner framework heterogen learner decis list linear separ complement elimin neg train data train phase increas accuraci test phase result show heterogen framework achiev high accuraci requir neg train data enhanc accuraci linear separ reduc error low margin data classifi accur requir human effort train gspan graph dbase substructur pattern mine investig approach frequent graph base pattern mine graph dataset propos algorithm call gspan graph base substructur pattern mine discov frequent substructur candid gener gspan build lexicograph order graph map graph uniqu minimum df code canon label base lexicograph order gspan adopt depth search strategi mine frequent connect subgraph effici perform studi show gspan substanti outperform previou algorithm order magnitud mine frequent item set opportunist project paper present algorithm opportuneproject mine complet set frequent item set project databas grow frequent item set tree algorithm fundament propos past opportunist choos structur arraybas tree base repres project transact subset heurist decid build unfilt pseudo project make filter copi featur subset importantli propos method build tree base pseudo project arrai base unfilt project project transact subset make algorithm cpu time effici memori save basic algorithm grow frequent item set tree depth search breadth search build upper portion tree test algorithm versu algorithm real world dataset bm po ibm artifici dataset empir result show algorithm effici spars dens databas level support threshold highli scalabl larg databas pebl posit base learn web page classif svm web mine specif classifi web page user interest class step mine interest inform web construct classifi interest class requir labori pre process collect posit neg train exampl instanc order construct homepag classifi collect sampl homepag posit exampl sampl homepag neg exampl collect neg train exampl requir arduou work special caution avoid bias introduc paper posit base learn ing pebl framework web page classif elimin manual collect neg train exampl pre process present algorithm call map converg achiev classif accuraci posit unlabel data high tradit svm posit neg data experi show algorithm amount posit exampl tradit svm algorithm perform tradit svm top fp dgrowth associ rule mine mine long sequenti pattern noisi environ applic includ comput biologi studi consum behavior analysi system perform analysi noisi environ observ sequenc accur reflect underli behavior protein sequenc amino acid mutat impact biolog function protein desir occurr observ relat mutat manner support measur number occurr pattern serv purpos paper introduc concept compat matrix mean provid probabilist connect observ underli true metric match propos captur real support pattern expect nois free environ assum addit context address pattern long standard prune techniqu develop market basket problem work effici result algorithm combin statist sampl techniqu border collaps devis discov long pattern minim number scan sequenc databas suffici high confid empir result demonstr robust match model respect nois effici probabilist algorithm cubeexplor onlin explor data cube multi ddimension regress analysi time dseri data stream real time product system dynam environ gener tremend potenti infinit amount stream data volum data huge store disk scan multipl time perform line multi dimension analysi data mine data alert peopl dramat situat initi time high qualiti respons challeng task paper quotient cube summar semant data cube partit data cube set cell similar behavior expos semant cube find averag boot sale west store walmart winter year signifi interest trend boot sale locat year paper interest find succinct summari data cube exploit regular present cube clear basi summari concis form lattic preserv rollup drilldown semant cube iii origin cube fulli recov emerg scientif applic data mine store data mine hypothes confirm data supplement experi long term signific data molecular biologi combin clinic medic data achiev higher resolut understand treatment diseas major challeng data mine biomedicin organ molecular data cellular data clinic data wai allow integr sake knowledg extract major addit sourc inform publish medic literatur increasingli onlin full text form unstructur summari main data biomed hypothes telecommun data mine flourish telecommun due avail vast quantiti high qualiti data signific stream consist call record collect network switch primarili emerg scientif applic data mine data mine web intellig data mine hold kei uncov claran method cluster object spatial data mine abstract paper describ result research develop effort conduct nasa am research center discov anomali discret paramet sequenc record flight data discret paramet record flight commerci airlin correspond binari switch insid cockpit input system record thousand flight class aircraft destin system deliv list potenti anomal flight reason flight tag anomal output analyz safeti expert determin anomali indic problem address human factor intervent final goal system safeti expert discov signific human factor issu pilot mode confus flight pilot lost situat awar reflect atyp sequenc switch throw descent compar popul similar flight view work extens integr system health manag ishm goal understand evalu combin health class aircraft destin constrain frequent pattern mine pattern dgrowth view databas research univers illinoi urbana dchampaign templat model multidimension inter dtransact associ rule multi ddimension sequenti pattern mine recent develop sequenti pattern mine algorithm prefixspan mine sequenti user access pattern web log inform redesign web site easier perus fewer network traffic bottleneck richer incorpor multipl dimens inform knew referr site user frequent determin inform web site interest enhanc separ inform need similarli knew weekdai time access pattern frequent occur ensur updat inform readi user thesi propos explor techniqu hybrid psfp incorpor addit dimens inform process mine sequenti pattern investig strength limit approach hybrid method find frequent dimens combin mine sequenti pattern set sequenc satisfi combin psfp approach problem opposit direct mine sequenti pattern dataset prefixspan mine frequent dimens pattern alongsid sequenti pattern exist associ algorithm fp growth experi show hybrid effect low support dataset spars respect dimens combin dens respect sequenti pattern present psfp altern case includ dataset dens respect dimens valu combin sequenti fault dtoler frequent pattern mine problem challeng rectre effici collabor filter method abstract peopl reli recommend trust friend find restaur movi match tast friend sampl item interest collabor filter cf seek increas effect process autom deriv recommend cliqu advisor prior person relationship cf promis tool deal inform overload face network world prior work cf dealt improv accuraci predict challeng scale method larg databas studi develop effici collabor filter method call rectre stand recommend tree address scalabl problem divid conquer approach method perform effici mean cluster group data creat neighborhood similar user perform subsequ cluster base smaller partit databas progress partit reduc search space dramat search advisori cliqu faster scan entir databas user addit partit user similar partit characterist rectre avoid dilut opinion good advisor multitud poor advisor yield higher accuraci base experi perform studi rectre outperform collabor filter corrcf execut time accuraci rectre execut time scale nlog dataset size corrcf scale quadrat prefixspan mine sequenti pattern prefix dproject growth spatial cluster presenc obstacl cluster spatial data mine group similar object base distanc connect rel densiti space real world exist physic obstacl river lake high wai presenc affect result clu tere substanti paper studi problem cluster presenc obstacl defin cod cluster obstruct distanc prob lem solut problem propos scal cluster algorithm call cod claran discuss form pre process inform enhanc efici cod claran strictest sens codproblem treat chang distanc function handl current cluster algorithm chang di tanc function show push task handl obstacl cod claran abstract distanc function level op timiz form prune func tion conduct perform studi show cod claran efici effec tive mine frequent item set convert constraint cmar accur effici classif base multipl class dassoci rule dmine hyper dstructur mine frequent pattern larg databas method effici mine frequent pattern studi extens research previous propos method encount perform bottleneck mine databas data characterist dens spars long short pattern memori base disk base constraint dbase cluster larg databas constrain cluster nding cluster satisfi user speci ed constraint highli desir applic paper introduc constrain cluster problem show tradit cluster algorithm mean handl scalabl constraint cluster algorithm coca develop studi start nding initi solut sati es user speci ed constraint ne solut perform con ned object movement constraint algorithm consist phase pivot movement deadlock resolut phase show nding optim solut np hard propos heurist show algorithm scale larg data set heurist micro cluster share experi show eectiv ecienc heurist mine top dn local outlier larg databas outlier detect import task data mine numer applic includ credit card fraud detect video surveil recent work outlier detect introduc notion local outlier degre object outli depend densiti local neighborhood object assign local outlier factor lof repres likelihood object outlier concept local outlier comput lofvalu data object requir larg number nearest neighbor search computation expens object outlier provid user option find outstand local outlier top data object local outlier lof prune carefulli find top outlier result amount comput find loffor object paper propos method effici find top local outlier larg databas concept micro cluster introduc compress data effici micro cluster base local outlier mine algorithm design base concept algorithm advers affect overlap micro cluster propos meaning cut plane solut overlap data formal analysi experi show method achiev good perform find outstand local outlier scalabl frequent dpattern mine method overview effici comput iceberg cube complex measur expens comput materi complet high dimension data cube comput iceberg cube aggreg threshold effect deriv nontrivi multidimension aggreg olap data mine paper studi effici method comput iceberg cube popularli complex measur averag develop methodolog adopt weaker anti monoton condit test prune search space effici comput iceberg cube averag measur propos top averag prune method extend previous studi method apriori buc top apriori top buc improv perform interest hypertre structur call tree design iceberg cube method call top cube develop perform studi show top buc top cube promis candid scalabl comput top cube perform case dna dminer system prototyp mine dna sequenc mine multi ddimension constrain gradient data cube introduct recent year grow interest multi dimension analysi relat databas transact reminisc influenti paper data mine concept techniqu introduc concept warehous model data schema closet effici algorithm mine frequent close itemset associ mine deriv undesir larg set frequent itemset associ rule recent studi propos interest altern mine frequent close itemset rule power associ mine substanti reduc number rule present paper propos effici algorithm closet mine close itemset develop techniqu appli compress frequent pattern tree fp tree structur mine close itemset candid gener develop singl prefix path compress techniqu identifi frequent close itemset quickli explor partit base project mechan scalabl mine larg databas perform studi show closet effici scalabl larg databas faster previous propos method introduct recogn frequent pattern minin aim approxim intellig match time seri data mine recurr item multimedia progress resolut refin overwhelm amount multimedia data recent gener signific data peopl systemat investig multimedia data mine previou studi content base retriev visual artifact studi paper method mine content base associ recurr item spatial relationship larg visual data repositori progress resolut refin approach propos frequent item set rough resolut level mine progress finer resolut mine candid frequent item set deriv mine rough resolut level multi resolut mine strategi substanti reduc data mine cost loss qualiti complet result push constraint frequent pattern mine freespan frequent pattern dproject sequenti pattern mine mine frequent pattern larg databas plai essenti role data mine task broad applic previous propos method adopt apriorilik candid gener test approach method encount challeng mine dataset prolif pattern long pattern geo dspatial cluster user dspecifi constraint duminda wijesekera daniel barbara session discuss variat multimedia data mine simeon simoff discuss multimedia mine encompass open issu coffe break sigkdd confer open award viii ix tabl content geo spatial cluster user constraint anthoni tong raymond ng lak lakshmanan jiawei han multi level index gi enhanc learn satellit imageri krzysztof koperski giovanni marchisio predict locat map similar plum framework spatial data mine sanjai chawla shashi shekhar weili wu uygar ozesmi learn prosod pattern mandarin speech synthesi yiqiang chen wen gao tingshao zhu coe cluster obstacl entiti preliminari studi mine access pattern effici web log explos growth data world wide web discoveri analysi inform world wide web practic necess web access pattern sequenc access pursu user frequent kind interest knowledg practic paper studi problem mine access pattern web log effici data structur call web access pattern tree wap tree short develop effici mine access pattern piec log web access pattern tree store highli compress critic inform access pattern mine facilit developmentofnovel algorithm mine access pattern larg set log piec algorithm find access pattern web log effici experiment perform studi show method gener order magnitud faster convent method mine frequent pattern candid gener paper propos data structur call cat tree cat tree extend idea fptree improv storag compress frequent pattern mine gener candid itemset propos algorithm enabl frequent pattern mine support rebuild tree structur algorithm mine singl pass databas effici insert delet transact time mine frequent itemset support constraint interest pattern occur vari level support classic associ mine base uniform minimum support apriori miss interest pattern low support suffer bottleneck itemset gener solut exploit support constraint minimum support requir itemset itemset gener paper present framework frequent itemset mine presenc support constraint approach push support constraint apriori itemset gener minimum support itemset run time preserv essenc apriori introduct associ rule mine studi ai market basket analysi find associ rule user minimum support minimum confid bottleneck problem find frequent itemset supp intratransact associ analysi mine multidimension intertransact associ rule object dbase select materi effici implement spatial data cube paper studi method spatial olap integr nonspati olap method spatial databas implement techniqu spatial data warehous model consist spatial nonspati dimens measur propos method comput spatial data cube analyt process spatial data cube studi strategi propos includ approxim select materi spatial object result spatial olap oper focu studi method spatial cube construct call object base select materi cuboid base select materi propos previou studi nonspati data cube construct cuboid atom structur select materi explor granular finer level singl cell cuboid algorithm propos object base select materi spatial data cube perform studi demonstr effect techniqu effici rule dbase attribut dorient induct data mine data mine import techniqu tremend potenti commerci industri applic attribut orient induct power mine techniqu successfulli implement data mine system dbminer induct capabl limit uncondit concept gener paper extend concept gener rule base concept hierarchi enhanc greatli induct power previous propos induct algorithm appli gener rule base case problem induct anomali occur impact effici develop effici algorithm facilit induct rule base case avoid anomali perform studi shown algorithm superior previous propos algorithm base backtrack keyword data mine knowledg discoveri databas rule base concept gener rule base concept hier discov geograph knowledg data rich environ report specialist meet mine frequent pattern pattern dgrowth methodolog implic plan mine divid dand dconquer plan sequenc action import form data prolifer databas technolog plan databas planbas increasingli common effici discoveri import pattern action plan databas present challeng data mine paper present method mine signific pattern success action larg planbas divid andconqu strategi method exploit multi dimensionm gener sequenc action extract inher hierarchicm structur sequenti pattern plan level abstract pattern turn subsequ narrow search specif pattern process anajog divid conquer method hierarchicm plan illustr approach travel plan databas mine inter dtransact associ templat multi dimension inter transact associ rule extend tradit associ rule describ gener associ item multipl properti cross transact mcdonald burger king open branch kfc open branch month mile rule number potenti inter transact associ rule extrem larg mine inter transact associ pose challeng effici process mine intra transact associ order make associ mine practic computation tractabl studi present templat model user declar interest inter transact associ mine guidanc templat optim techniqu devis speed discoveri inter transact associ rule show seri experi optim techniqu yield significa effici mine partial period pattern time seri databas partial period search search partial period pattern time seri databas interest data mine problem previou studi period search find full period pattern point time contribut precis approxim period partial period common practic time episod exhibit period pattern present algorithm effici mine partial period pattern explor interest properti relat partial period apriori properti max subpattern hit set properti share mine multipl period max subpattern hit set properti vital properti deriv count frequent pattern small subset pattern exist time seri show mine partial period scan time seri databas mine multipl period perform studi show propos method effici mine long period pattern break barrier transact mine inter dtransact associ rule optim constrain frequent set queri dvariabl constraint tremend interest provid ad hoc mine capabl databas manag system step goal propos architectur support constraint base human center exploratori mine kind rule includ associ introduc notion constrain frequent set queri cfq develop effect prune optim cfq variabl var constraint var constraint exploratori mine constrain frequent set queri studi data mine date research prototyp commerci system support comprehens queri driven mine encourag interact explor data thesi constraint construct optim induc plai pivot role mine queri substanti enhanc us perform mine system base analog dedar queri languag sol queri optim made relat databas success end propos demo data mine system paradigm data mine mine constraint import step support ad hoc mine dbm effici polygon amalgam method spatial olap spatial data mine polygon amalgam oper comput boundari union set polygon import oper spatial line analyt process spatial data mine polygon repres spatial object amalgam vari criteria user aggreg reclassifi object process cost oper high larg number polygon base observ polygon amalgam contribut boundari investig paper effici polygon amalgam method exclud intern polygon retriev databas algorithm adjac base occup base propos review arrai dbase algorithm simultan multidimension aggreg constraint dbase multidimension data mine part databas mine call minabl view type pattern rule mine properti pattern satisfi pattern includ numer constraint statist properti support confid correl base attribut domain class aggreg type snack avg price lt data mine system support effici process optim mine queri provid sophist mine queri optim optim exploit constraint state user mine queri properti gener access plan guarante level perform commensur constraint queri constraint essenti ad hoc data mine divid constraint categori knowledg type constraint type knowledg mine concept join index hierarchi index structur effici navig object dorient databas index structur join index hierarchi propos handl goto disk problem object orient queri process method construct hierarchi join indic transform sequenc pointer chase oper simpl search join index file acceler navig object orient databas method extend join index structur studi relat spatial databas support forward backward navig object class local updat propag hierarchi perform studi show partial join index hierarchi outperform index mechan object orient queri process index term index structur join indic queri process queri optim object orient databas introduct queri process optim crucial perform object orient databas system substanti research queri process queri mine multipl dlevel associ rule larg databas discov web access pattern trend appli olap data mine technolog web log con uenc data mine www technolog perform data mine web logrecord collectedfrom internet web page access histori behaviour web page reader imprint web server log le analyz explor regular behaviour improv system perform enhanc qualiti deliveri internet inform servic end user identifi popul potenti custom electron commerc observ peopl collect data data mine bring consider contribut digit librari design mine multimedia data propos multi wing harmonium model mine multimedia data extend improv earlier model base layer random field captur bidirect depend hidden topic aspect observ input model view undirect counterpart layer direct model lda similar task bear signific di erenc infer learn cost tradeoff latent topic represent topic mix mechan model facilit effici infer robust topic mix potenti high flexibl model latent topic space contrast diverg variat algorithm deriv learn special model dual wing harmonium caption imag incorpor multivari poisson word count multivari gaussian color histogram present empir result applic model classif retriev imag annot new video collect report extens comparison extant model mine segment dwise period pattern time drelat databas period search search cyclic time relat databas interest data mine problem previou studi find full cycl period segment select sequenc data sequenc period point segment period repeat mine segment wise point wise period time relat data set studi integr data cube apriori data mine techniqu mine segment wise period regard fix length period show data cube effici structur conveni interact mine multipl level period introduct period search search cyclic pattern time relat data set import data mine problem applic previous studi method period pattern search mine full cycl period sens point pe select materi effici method spatial data cube construct line analyt process olap gain popu lariti databas industri huge amount data store spatial databas introduct spatial compon relat object relat databas import studi method spatial data wareh line analyt process spatial data paper studi method spatial olap integra tion nonspati line analyt process olap method spatial databas implement techniqu spatial data warehous model consist spatial nonspati dimens measur propos method comput spatial data cube analyt process spatial data cube studi strategi propos includ approxim partial materi spatial object result spatial olap oper exploratori mine prune optim constrain associ rule standpoint support human center discoveri knowledg present dai model mine associ rule suffer shortcom ing lack user explor control ii lack focu iii rigid notion relationship effect model function black box admit user interact propos paper architectur open black box support constraintbas human center exploratori mine associ foundat architectur rich set con straint construct includ domain class ql style aggreg constraint enabl user associ mine propos constrain associ queri mean constraint satisfi anteced consequ mine associ multimediamin system prototyp multimedia data mine datasurg group ndsu long stand interest data mine remot sens imageri rsi agricultur forestri predict analysi applic spatial data structur peano count tree develop provid effici lossless data mine readi represent type data involv applic data structur made mine multipl larg data set includ time sequenc rsi multimedia land data peano count tree tree technolog effici store mine imag format pertin land data format webml queri world dwide web resourc knowledg massiv increas inform electron network profus resourc world wide web gave rise consider interest research commun tradit inform retriev techniqu appli document collect internet amyriad search engin tool propos implement ectiv tool satisfactori capabl discov knowledg internet propos declar queri languag resourc discoveri internet interact progress ned inquiri languag consent discoveri knowledg content document structur hyperspac gener dbase data mine object dorient databas object cube model data mine discoveri knowledg inform larg amount data store databas increas popular object orient databas system advanc databas applic import studi data mine method object orient databas mine knowledg databas improv understand organ util data store editori call amp calendareditori evalu declar dqueen recurs deduct databas approach knowledg represent discoveri base linguist atom dline analyt mine larg databas great effort paid intellig databas system research lab research develop effici data mine method construct line analyt data mine system work dbminer system data mine relat databas data warehous olap mine integr olap data mine olap mine mechan integr line analyt process olap data mine mine perform portion databas data warehous level abstract user finger tip rapid develop data warehous olap technolog databas industri promis develop olap mine mechan data mine head panel metarul dguid mine multi ddimension associ rule data cube paper emploi approach metarul guid multi dimension associ rule mine explor data cube structur gener decis tree induct effici classif data mine effici scalabl fundament issu data mine larg databas classif studi extens method consider effici induct larg databas analysi data multipl abstract level paper address effici scalabl issu propos data classif method integr attribut orient induct relev analysi induct decis tree integr lead effici high qualiti multipl level classif larg amount data relax requir perfect train set eleg handl continu noisi data geomin system prototyp spatial data mine spatial data mine mine high level spatial inform knowledg larg spatial databas spatial data mine system prototyp geomin design develop base year experi research develop relat data mine system dbminer research spatial data mine data mine power geomin includ mine kind rule characterist rule comparison rule associ rule geo spatial databas plan extens includ mine classif rule cluster rule sand spatial nonspati data architectur appli model spatial databas geomin includ spatial data cube construct modul spatial line analyt process olap modul spatial data mine modul spatial data mine languag gmql geo mine queri languag design implement extens spatial sql spatial data mini proceed intern confer knowledg discoveri data mine kdd structur attribut domain set partial order set typic hierarchi attribut knowledg discoveri program incorpor background knowledg hierarch relationship attribut valu induct gener rule structur attribut develop consider type node domain hierarchi anchor anchor type decis rule gener characterist discrimin minimum complex gener rule enhanc abil knowledg discoveri system inlen exploit semant content domain knowledg process gener hypothes depend attribut decis attribut structur system gener system hierarch organ rule repres relationship valu attribut independ attribut situat occur practic decis assign situat level abstract liver diseas liver cancer continu attribut physic measur quantiz hierarchi valu rang valu arrang level method illustr discoveri pattern world econom demograph spatial data mine progress challeng spatial data mine mine knowledg larg amount spatial data highli demand field huge amount spatial data collect applic rang remot sens geograph inform system gi comput cartographi environment assess plan collect data exceed human abil analyz recent studi data mine extend scope data mine relat transact databas spatial databas paper summar recent work spatial data mine spatial data gener spatial data cluster mine spatial associ rule show spatial data mine promis field fruit research result challeng issu introduct advanc databas technolog data collect techniqu includ barcod read remot sens satellit telemetri collect huge amount data larg data mainten discov associ rule larg databas increment updat techniqu increment updat techniqu develop mainten associ rule discov databas mine studi effici discoveri associ rule larg databas nontrivi maintain discov rule larg databas databas frequent occasion updat updat invalid exist strong associ rule turn weak rule strong studi increment updat techniqu propos effici mainten di cover associ rule transact data ad transact databas dbminer system mine knowledg larg relat databas data mine system dbminer develop interact mine multipl level knowledg larg relat databas system implement wide spectrum data mine function includ gener character associ classi cation predict incorpor interest data mine techniqu includ attributeori induct statist analysi progress deepen mine multipl level knowledg meta rule guid mine system userfriendli interact data mine environ good perform fast distribut algorithm mine associ rule exist larg transact databas huge amount data high scalabl distribut system easi partit distribut central databas import investig effici method distribut mine associ rule studi disclos interest relationship local larg global larg itemset propos interest distribut associ rule mine algorithm fdm fast distribut mine associ rule gener small number candid set substanti reduc number messag pass mine associ rule perform studi show fdm superior perform direct applic typic sequenti algorithm perform enhanc lead variat algorithm data mine techniqu paper discuss overview data mine techniqu person discuss standard techniqu order adapt increas abil system tailor specif user behavior discuss techniqu collabor filter content base method content base collabor filter method examin specif applic techniqu scenario broad advantag specif situat dbminer interact mine multipl dlevel knowledg relat databas attribut dorient induct data mine attribut orient induct set orient databas mine method gener task relev subset data attribut attribut compress gener relat extract gener featur data chapter power attribut orient induct explor extract relat databas kind pattern includ characterist rule discrimin rule cluster descript rule multipl level associ rule shown method effici robust wide applic extens knowledg discoveri advanc databas system includ object orient deduct spatial databas system implement statu dbminer system prototyp appli method report introduct upsurg applic demand research activ knowledg discoveri databas matheu chan piatetski shapiro pi intellig queri answer knowledg discoveri techniqu knowledg discoveri facilit queri databas knowledg intellig queri answer databas system paper investig applic discov knowledg concept hierarchi knowledg discoveri tool intellig queri answer databas system knowledg rich data model construct incorpor discov knowledg knowledg discoveri tool queri classifi data queri knowledg queri type queri answer directli simpl retriev intellig analyz intent queri provid gener neighborhood inform store discov knowledg techniqu develop intellig queri answer discov knowledg knowledg discoveri tool includ gener data summar concept cluster rule discoveri queri rewrit deduct lazi evalu applic multiplelay databas studi show knowledg discoveri substanti broaden spectrum intellig queri answer deep implic queri answer data knowledg base system data mine overview databas perspect index nest effici approach index object dorient databas lt gt object orient databas system concept superclass subclass support instanc subclass instanc superclass access scope queri class gener includ access scope subclass index support superclass subclass relationship effici provid effici associ retriev object singl class class class hierarchi paper present effici index call hierarch tree tree class tree maintain allow effici search singl class tree appropri link captur superclass subclass relationship allow effici retriev instanc class hierarchi experiment analyt result tree effici index structur lt gt kei word lt gt oodb index structur mine knowledg multipl concept level studi data mine focus mine rule singl concept level primit level high concept level desir discov knowledg multipl concept level mine knowledg multipl level databas user find interest rule difficult discov view databas content abstract level angl method mine knowledg multipl concept level develop extens exist data mine techniqu effici process interact mine multipl level rule adopt techniqu step step gener special progress deepen knowledg mine process issu visual represent knowledg multipl level redund rule filter studi depth normal compil deduct object dorient databas program effici queri evalu normal process propos serv preprocess stage compil evalu tool classifi recurs queri independ compil chain base evalu method extend natur process class dood program queri queri independ compil captur bind difficult captur chain base evalu explor queri constraint integr constraint recurs structur featur program set interest techniqu chain chain split constraint push normal compil process class dood queri evalu effici deduct object orient databas keyword deduct object orient databas compil recurs queri evalu queri optim introduct recurs queri evalu investig extensivel advanc dblearn system knowledg discoveri larg databas resourc knowledg discoveri global inform system preliminari design experi huge amount inform connect global inform network internet effici effect discoveri resourc knowledg global inform base immin research issu advent inform superhighwai articl multipl layer databas mldb approach propos handl resourc knowledg discoveri global inform base preliminari experi line technic report repres subset internet show advantag approach multipl layer databas databas form gener transform inform layer layer start origin inform base treat layer primit layer inform retriev data mine data analysi techniqu extract transform inform lower layer databas higher layer higher layer mldb model meta drule dguid mine associ rule relat databas meta rule guid data mine approach propos studi apph meta rule guidanc find multipl level associ rule larg relat databas meta rule rule templat form predic variabl anteced consequ meta rule instantjar rule templat describ form rule expect found databas rule templat guidanc constraint data mine process note predic variabl meta rule instantjar databas schema variabl high level constant insid predic bound multipl specif level concept con ceptual hierarchi concret rule concept level discov progress deepen data mine techniqu similar develop studi mine multipl level associ rule algorithm develop hne perform studi conduct compar rel effici experiment perform studi demonstr method power effici data mine larg databas mainten discov knowledg strategi updat associ rule abstract discoveri spatial associ rule geograph inform databas abstract spatial data mine discoveri interest implicit knowledg spatial databas import task understand spatial data knowledg base paper cient method mine strong spatial associ rule geograph inform databas propos studi spatial associ rule rule indic associ relationship set spatial possibl nonspati predic strong rule pattern rule frequent occurr databas strong implic relationship optim techniqu explor includ step spatial comput techniqu approxim comput larg set ned comput small promis pattern share process deriv larg predic multipl concept level analysi show interest associ rule discov cientli larg spatial databas discoveri multipl dlevel associ rule larg databas previou studi mine associ rule find rule singl concept level mine associ rule multipl concept level lead discoveri specif concret knowledg data studi top progress deepen method develop mine multiplelevel associ rule larg transact databas extens exist associ rule mine techniqu group variant algorithm propos base wai share intermedi result rel perform test kind data relax rule condit find level cross associ rule discuss paper chain dsplit evalu deduct databas popularli studi recurs deduct databas compil set highli regular chain gener path consist set connect predic previou studi chain base queri evalu deduct databas chain gener path insepar unit evalu recurs function recurs compil chain consist infinit evalu function evalu chain split evalu split chain gener path portion evalu immedi evalu portion delai evalu portion paper necess chain split evalu examin point view effici finit evalu chain split evalu techniqu magic set buffer evalu partial evalu develop studi show chain split evalu primit recurs queri evalu techni evalu regular nonlinear recurs deduct databas techniqu nonlinear recurs challeng class logic program effici evalu logic program system identifi popular class nonlinear recurs regular nonlinear recurs investig effici implement deduct databas approach approach perform detail queri bind analysi base queri inform constraint inform structur recurs select predic evalu order gener effici queri evalu plan interest queri evalu techniqu chain chain split constraint push develop effici evalu kind queri techniqu extend evalu regular nonlinear recurs hilog logic program studi present method evalu regular nonlinear recurs declar demonstr power deduct datab inform dassoci join indic spatial rang search fact updat logic databas logicbas deduct databas system prototyp deduct databas system prototyp logicbas develop emphasi effici compil queri evalu applic orient recurs deduct databas system identifi class recurs compil recurs chain pseudo chain form queri pose compil recurs analyz systemat effici evalu plan gener execut base chain base queri evalu method system test sophist recurs queri satisfactori perform paper introduc gener design principl implement techniqu system discuss strength limit introduct import extens relat approach research deduct databas system repres direct declar queri process high level databas program integr logic program relat databa cooper queri answer multipl layer databas real estat agent respond inquiri quickli intellig trick simpl tabl briefli outlin gener inform complet book refer detail method gener construct multipl layer databas mldb databas organ techniqu cooper queri answer databas brows queri optim queri cooper inform system paper studi construct mldb gener knowledg discoveri techniqu applic mldb cooper intellig queri answer databas system introduct cooper intellig queri answer refer mechan answer queri cooper intellig analyz intent queri provid gener neighborhood answer interest techniqu develop cooper queri knowledg discoveri cooper activ databas techniqu control dynam environ dynam environ product process commun network highwai traffic huge amount inform chang time valuabl resourc understand gener behavior environ discov regular anomali happen environ control evolut process intellig model manag environ data gener dynam environ express low level primit huge volum dynam continu rapid inform flow difficult catch regular anomali dynam environ react promptli real time applic studi knowledg discoveri techniqu integr data sampl activ databas techniqu discov interest behavior dynam environ react intellig environ discov increment process logic databas relat dynam gener refin concept hierarchi knowledg discoveri databas concept hierarchi organ data concept hierarch form partial order help express knowledg data relationship databas concis high level term plai import role knowledg discoveri process concept hierarchi provid knowledg engin domain expert user embed data relat desir automat gener concept hierarchi adjust hierarchi learn task paper issu dynam gener refin concept hierarchi studi studi lead algorithm automat gener concept hierarchi numer attribut base data distribut dynam refin gener concept hierarchi base learn request relev set data databas statist algorithm implement dblearn knowledg discoveri syst dblearn system prototyp knowledg discoveri relat databas effici effect cluster method spatial data mine spatial data mine discoveri interest relationship characterist exist implicitli spatial databas paper explor cluster method role plai spatial data mine end develop cluster method call claran base random search de velop spatial data mine algorithm claran analysi experi show assist claran algorithm effect lead discoveri difficult find current spatial data mine algorithm join index hierarchi support effici navig object dorient databas delai dsensit multimedia disk constraint dbase queri evalu deduct databas constraint plai import role effici queri evalu deduct databas paper constraint base queri evalu deduct databas investig emphasi linear recurs function symbol constraint classifi class rule constraint ii integr constraint iii queri constraint techniqu develop maxim kind constraint rule compil queri evalu studi role class constraint set orient evalu linear recurs show rule constraint integr deduct rule compil recurs ii integr constraint includ finit constraint monoton constraint analysi finit evalu termin specif queri iii queri constraint search space reduct terminati studi structur linear recurs multichannel delai sensit data retriev effici induct mechan databas system normal linear recurs deduct databas evalu regular nonlinear recurs program homomorph tree embed applic recurs program optim paper concern problem stage preserv linear bounded human dcomput interfac dblearn system attribut dorient rough set approach knowledg discoveri databas knowledg discoveri databas kdd activ research area promis high payoff busi scientif applic grand challeng knowledg discoveri databas automat process larg quantiti raw data identifi signific meaning pattern present knowledg form achiev user goal knowledg discoveri system face challeng problem real world databas tend larg redund noisi dynam problem address extent machin learn system address collect handl problem produc knowledg effici effect main focu thesi thesi develop attribut orient rough set approach knowledg discoveri databas method adopt artifici intellig learn exampl paradigm combin rough outlin logicbas demonstr logicbas system prototyp deduct queri evalu outlin logicbas demonstr data ddriven discoveri quantit rule relat databas quantit rule rule quantit inform assess representativehess rule databas paper effici induct method develop learu quantit rule relat databas assist knowledg concept hierarchi data relev expect rule form attribut orient induct perform databas integr databas oper learu process simpl effici learn quantit rule larg databas method learn characterist rule classif rule quantit inform facilit quantit reason increment learn learu presenc nois learu qualit rule treat special case learu quantit rule paper show attributeori induct effici effect mechan learn kind knowledg rule relat databas compil evalu linear mutual recurs compil dbase list process deduct databas effici deduct induct kei success data dintens knowledg dbase system distanc dassoci join indic spatial rang search chain dsplit evalu deduct databas popularli studi recurs deduct databas compil set highli regular chain gener path consist set connect predic previou studi chain base queri evalu deduct databas chain gener path insepar unit evalu recurs function recurs compil chain consist infinit evalu function evalu chain split evalu split chain gener path portion evalu immedi evalu portion delai evalu portion paper necess chain split evalu examin point view effici finit evalu chain split evalu techniqu magic set buffer evalu partial evalu develop studi show chain split evalu primit recurs queri evalu techni chain dbase evalu bridg link recurs nonrecurs queri evalu knowledg discoveri databas attribut dorient approach knowledg discoveri databas data mine import issu develop data knowledg base system attribut orient induct method develop knowledg discoveri databas method integr machin learn paradigm learn exampl techniqu set orient databas oper extract gener data actual data databas attribut orient concept tree ascens techniqu appli gener substanti reduc comput complex databas learn process kind knowledg rule includ characterist rule discrimin rule quantit rule data evolut regular discov effici attribut orient approach addit learn relat databas approach appli knowledg discoveri nest relat deduct databas learn perform databas noisi data except case databas statist rule discov queri databas knowledg answer cooper queri facilit semant queri optim base principl prototyp databas learn system dblearn construct experiment dqueen problem revisit deduct databas approach compress count method classif compil linear recurs queri deduct databas automat gener compil form linear recurs bind propag reach rule fgoal graph automat gener compil form linear recurs effici access method deduct object dorient databas power queri dindepend compil constraint dbase reason deduct databas constraint plai import role effici queri evalu deduct databas paper constraint base queri evalu deduct databas investig emphasi linear recurs function symbol constraint classifi class rule constraint ii integr constraint iii queri constraint techniqu develop maxim kind constraint rule compil queri evalu studi role class constraint set orient evalu linear recurs show rule constraint integr deduct rule compil recurs ii integr constraint includ finit constraint monoton constraint analysi finit evalu termin specif queri iii queri constraint search space reduct terminati effici evalu linear recurs function sysmbol deduct databas attribut dorient induct relat databas knowledg discoveri databas data mine import issu develop data knowledg base system attribut orient induct method develop knowledg discoveri databas method integr machin learn paradigm learn exampl techniqu set orient databas oper extract gener data actual data databas attribut orient concept tree ascens techniqu appli gener substanti reduc comput complex databas learn process kind knowledg rule includ characterist rule discrimin rule quantit rule data evolut regular discov effici attribut orient approach addit learn relat databas approach appli knowledg discoveri nest relat deduct databas learn perform databas noisi data except case databas statist rule discov queri databas knowledg answer cooper queri facilit semant queri optim base principl prototyp databas learn system dblearn construct experiment learn relat databas attribut dorient approach effici evalu multipl linear recurs evalu function linear recurs compil approach attribut dorient approach learn classif rule relat databas path approach incorpor list process relat databas transit closur recurs singl dchain recurs asynchron chain recurs synchron chain recurs frequent form queri deduct databas system effici queri process requir algorithm suitabl parallel process need paper generalis arithmet method queri answer integ arithmet path length queri subgraph databas diagraph chain recurs introduct assumpt pervad ddb literatur singl evalu work effici form recurs queri ii major ddb queri singl linear recurs linear sirup canon strongli linear sl queri effici ddb system number queri process method perform significantli improv effici handl linear recurs wai improv ddb system perform develop effici queri process algorithm ii make parallel process chain recurs level dcycl merg method process multipl linear recurs deriv magic set compil compil gener linear recurs variabl connect graph analysi asynchron chain recurs synchron chain recurs frequent form queri deduct databas system effici queri process requir algorithm suitabl parallel process need paper generalis arithmet method queri answer integ arithmet path length queri subgraph databas diagraph chain recurs introduct assumpt pervad ddb literatur singl evalu work effici form recurs queri ii major ddb queri singl linear recurs linear sirup canon strongli linear sl queri effici ddb system number queri process method perform significantli improv effici handl linear recurs wai improv ddb system perform develop effici queri process algorithm ii make parallel process chain recurs multi dwai count method process evalu transit closur queri semant queri optim recurs databas kind recurs process transit closur strategi select process strategi recurs queri ddirect recurs formula classif recurs formula deduct databas handl redund process recurs databas queri perform result recurs queri process relat databas system 